scientific article; zbMATH DE number 3561085

MaRDI QIDQ4132008zbMATH OpenFDO

Authors E. Balas

Publication date 1977

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of partitions of integers (05A17)

Cited in

(9)

• Complementary column generation and bounding approaches for set partitioning formulations
• Modeling and algorithmic development of a staff scheduling problem
• On cutting-plane proofs in combinatorial optimization
• On the complete set packing and set partitioning polytopes: properties and rank 1 facets
• Tighter representations for set partitioning problems
• New enhancements for the exact solution of the vehicle routing problem with time windows
• A relax-and-cut algorithm for the set partitioning problem
• A special case of set covering problems
• Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132008)