Order preserving assignments without contiguity

DOI10.1016/0012-365X(95)00325-QzbMath0879.90154MaRDI QIDQ1356521

Dimitris Alevras

Publication date: 9 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

longest path formulationorder preserving assignmentpolynomial-time separation algorithm

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Combinatorial optimization (90C27) Dynamic programming (90C39) Discrete location and assignment (90B80)

Related Items (1)

Scheduling two chains of unit jobs on one machine: A polyhedral study

Cites Work

• Geometric algorithms and combinatorial optimization
• Linear optimization and extensions
• Perfect zero–one matrices
• On the facial structure of set packing polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Order preserving assignments without contiguity