scientific article; zbMATH DE number 3561085

zbMATH Open0359.90051MaRDI QIDQ4132008FDOQ4132008

Authors: E. Balas 

Publication date: 1977

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (9)

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

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)