Integer programming formulation of combinatorial optimization problems
- 30 September 1976
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 16 (1) , 39-52
- https://doi.org/10.1016/0012-365x(76)90091-1
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On defining sets of vertices of the hypercube by linear inequalitiesDiscrete Mathematics, 1975
- On the existence of optimal solutions to integer and mixed-integer programming problemsMathematical Programming, 1974
- Canonical Cuts on the Unit HypercubeSIAM Journal on Applied Mathematics, 1972
- The Airline Crew Scheduling Problem: A SurveyTransportation Science, 1969
- An integer linear programming model of a school timetabling problemThe Computer Journal, 1969
- Algorithms for the Simple Plant-Location Problem with Some Side ConditionsOperations Research, 1969
- Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D ProjectsManagement Science, 1967
- The Decision Problem for Exponential Diophantine EquationsAnnals of Mathematics, 1961
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960
- On the Significance of Solving Linear Programming Problems with Some Integer VariablesEconometrica, 1960