scientific article; zbMATH DE number 3561085

zbMath0359.90051MaRDI QIDQ4132008

Egon Balas

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms ⋮ A special case of set covering problems ⋮ Tighter representations for set partitioning problems ⋮ On cutting-plane proofs in combinatorial optimization ⋮ On the complete set packing and set partitioning polytopes: properties and rank 1 facets ⋮ New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows ⋮ A relax-and-cut algorithm for the set partitioning problem ⋮ Modeling and algorithmic development of a staff scheduling problem ⋮ Complementary column generation and bounding approaches for set partitioning formulations

This page was built for publication: