Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ORL
1998

favoriteEmaildiscussreport

97views more ORL 1998»

The complexity of cover inequality separation

13 years 4 months ago

The complexity of cover inequality separation

Download cgm.cs.mcgill.ca

Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that the general problem is NP-hard but a special case is solvable in linear time. c 1998 Elsevier Science B.V. All rights reserved.

Diego Klabjan, George L. Nemhauser, Craig A. Tovey

Real-time Traffic

Binary Integer Programs | Crowder Et | ORL 1998 | Separation Problem |

claim paper

Related Content

» On separating cover inequalities for the multidimensional knapsack problem

» Capacitated facility location Separation algorithms and computational experience

» Separation algorithms for 01 knapsack polytopes

» The network inhibition problem

» A new exponential separation between quantum and classical oneway communication complexity

» Pareto Complexity of TwoParameter FPT Problems A Case Study for Partial Vertex Cover

» On Complexity of Optimal Recombination for Binary Representations of Solutions

» Exponential separations for oneway quantum communication complexity with applications to c...

» Constraint Automata and the Complexity of Recursive Subtype Entailment

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	ORL
Authors	Diego Klabjan, George L. Nemhauser, Craig A. Tovey

Comments (0)