An integer programming approach to a class of combinatorial problems

DOI10.1007/BF01585006zbMath0249.90052MaRDI QIDQ5663651

No author found.

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20)

Related Items (7)

The reduced cost branch and bound algorithm for mixed integer programming ⋮ Locational analysis ⋮ A distance assignment approach to the facility layout problem ⋮ Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand ⋮ A o(n logn) algorithm for LP knapsacks with GUB constraints ⋮ The splitting of variables and constraints in the formulation of integer programming models ⋮ A dynamic programming algorithm for multiple-choice constraints

Cites Work

• Unnamed Item
• Assignment Problems and the Location of Economic Activities
• Practical Solution of Large Mixed Integer Programming Problems with Umpire

This page was built for publication: An integer programming approach to a class of combinatorial problems