On the extension complexity of scheduling polytopes
- 20 May 2020
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 48 (4) , 472-479
Abstract
No abstract availableKeywords
Funding Information
- GAČR project, Czech Republic (17-09142S)
- Fondecyt Regular (1170223)
This publication has 16 references indexed in Scilit:
- On the extension complexity of combinatorial polytopesMathematical Programming, 2014
- Extended formulations in combinatorial optimizationAnnals of Operations Research, 2013
- Some 0/1 polytopes need exponential size extended formulationsMathematical Programming, 2012
- Graph Balancing: A Special Case of Scheduling Unrelated Parallel MachinesAlgorithmica, 2012
- Santa Claus Schedules Jobs on Unrelated MachinesSIAM Journal on Computing, 2012
- Expressing combinatorial optimization problems by Linear ProgramsJournal of Computer and System Sciences, 1991
- Using separation algorithms to generate mixed integer model reformulationsOperations Research Letters, 1991
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Matroids and the greedy algorithmMathematical Programming, 1971