The permutahedron of N-sparse posets

Mathematical Programming, Series B

Volumn 75, Issue 1, 1996, Pages 1-18

  Von Arnim, Annelie ^a   Schrader, Rainer ^a   Wang, Yaoguang ^b,c  

^a UNIVERSITY OF COLOGNE   (Germany)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Combinatorial optimization; Polyhedra; Precedence constraints; Weighted completion time scheduling

Indexed keywords

EID: 0038673521     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592204     Document Type: Article

References (15)

1. A. von Arnim, U. Faigle and R. Schrader, "The permutahedron of series-parallel posets", Discrete Applied Mathematics 28 (1990) 3-9.
2. A. von Arnim and A. Schulz, "Facets of the generalized permutahedron of a poset", Discrete Applied Mathematics 72 (1997) to appear.
3. E. Balas, "A linear characterization of permutation vectors", Management Sci. Res. Report 364, Carnegie-Mellon University, Pittsburgh, PA, 1975.
4. P. Gaiha und S.K. Gupta, "Adjacent vertices on a permutation", SIAM Journal on Applied Mathematics 32 (1977) 323-327.
5. M. Habib and R. Möhring, "On some complexity properties of N-free posets and posets with bounded decomposition parameter", Discrete Mathematics 63 (1987) 157-182.
6. 4-sparse graphs", Discrete Applied Mathematics 35 (1992) 115-129.
7. V. Klee and G.J. Minty, "How good is the simplex algorithm", in: O. Shisha, ed., Inequalities III (Academic Press, New York, 1972).
8. E.L. Lawler, "Sequencing jobs to minimize total weighted completion time subject to precedence constraints", Annals of Discrete Mathematics 2 (1978) 75-90.
9. M. Queyranne and Y. Wang, "Single-machine scheduling polyhedra with precedence constraints", Mathematics of Operations Research 16 (1991) 1-29.
10. R. Rado, "An inequality", Journal of the London Mathematical Society 27 (1952) 1-6.
11. P.H. Schoute, "Analytical treatment of the polytopes regularly derived from regular polytopes", Johannes Müller, 1911.
12. J.B. Sidney, "Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs", Operations Research 23 (1975) 283-298.
13. V.A. Yemelichev, M.M. Kovalev and M.K. Kravtsov, Polytopes, Graphs and Optimization, (Cambridge University Press, Cambridge, 1984).
14. H.P. Young, "On permutations and permutation polytopes", Mathematical Programming Study (1978) 128-140.
15. G. Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics 152 (Springer, New York, 1995).