论文信息 - Setup optimization problems with matroid structure

Setup optimization problems with matroid structure

A class of ordered sets is investigated for which the setup minimization problem gives rise to matroid independence systems. This class includes in particular all N-free ordered sets and all M-free ordered sets of height at most one. The matroid structure can be recognized efficiently; whence the matroid greedy algorithm may be used to solve the weighted minimization problem.

Rainer Schrader | Ulrich Faigle

[1] Gerhard Gierz,et al. Minimizing Setups for Ordered Sets: A Linear Algebraic Approach , 1983 .

[2] Ulrich Faigle,et al. Geometries on partially ordered sets , 1980, J. Comb. Theory B.

[3] Rainer Schrader,et al. Algorithmic approaches to setup minimization , 1985, SIAM J. Comput..

[4] Ulrich Faigle,et al. A Construction for Strongly Greedy Ordered Sets , 1984 .

[5] Michel Habib,et al. Nombre de sauts et graphes série-parallèles , 1979, RAIRO Theor. Informatics Appl..

[6] Charles J. Colbourn,et al. Minimizing setups in ordered sets of fixed width , 1985 .

[7] Ivan Rival. Optimal linear extensions by interchanging chains , 1983 .

[8] Mohamed H. El-Zahar,et al. Greedy linear extensions to minimize jumps , 1985, Discret. Appl. Math..

[9] P. Winkler,et al. Minimizing setups for cycle-free ordered sets , 1982 .

[10] Mirosław Truszczyński. Jump number problem: The role of matroids , 1985 .

[11] Rainer Schrader,et al. Minimizing Completion Time for a Class of Scheduling Problems , 1984, Inf. Process. Lett..

[12] Maciej M. Syslo. A Graph-Theoretic Approach to the Jump-Number Problem , 1985 .