A generalization of extension complexity that captures P
Authors:
- David AvisDADavid Avis
- Hans Raj TiwaryHTHans Raj Tiwary
- 1 June 2015
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 115 (6-8) , 588-593
Abstract
No abstract availableAll Related Versions
Funding Information
- Ministry of Education, Culture, Sports, Science and Technology
- Grantová Agentura České Republiky
This publication has 7 references indexed in Scilit:
- Extended formulations in combinatorial optimization4OR, 2010
- 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
- Induced matchingsDiscrete Applied Mathematics, 1989
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1985
- NP-completeness of some generalizations of the maximum matching problemInformation Processing Letters, 1982
- Edge Dominating Sets in GraphsSIAM Journal on Applied Mathematics, 1980