An integer programming approach to a class of combinatorial problems

DOI10.1007/BF01585006MaRDI QIDQ5663651zbMATH OpenFDO

Authors

Publication date 1972

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01585006

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3526452 (Why is no real title available?)
• Assignment Problems and the Location of Economic Activities
• Practical Solution of Large Mixed Integer Programming Problems with Umpire

Cited in

(7)

• 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
• Locational analysis
• A distance assignment approach to the facility layout problem
• The splitting of variables and constraints in the formulation of integer programming models
• A dynamic programming algorithm for multiple-choice constraints
• The reduced cost branch and bound algorithm for mixed integer programming

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

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