Alberto Caprara, Adam N. Letchford  Home/Search
Context Related
| or.deis.unibo.it/alberto...split_fin.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: or.deis.unibo.it/alberto...online (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities for integer programming which include a variety of other well-known cuts as special cases. To detect violated split cuts, one has to solve the associated separation problem. The complexity of split cut separation was recently cited as an open problem by Cornuejols & Li [10]. In this paper we settle this question by proving strong NP-completeness of separation for split cuts. As a by-product we also show... (Update)
Context of citations to this paper: More
.... complexity of the separation problem for disjunctive cuts was raised by Cornu ejols and Li [5] and recently settled by Caprara and Letchford [2]. They reduce the max cut problem to the separation problems for disjunctive cuts, balanced disjunctive cuts and binary disjunctive...
Cited by: More
Recognition and Separation of Chvátal and Disjunctive .. - Cornuéjols, Li (2001) (Correct)
Similar documents (at the sentence level):
54.3%: On the Separation of Split Cuts and Related Inequalities - Caprara, Letchford (Correct)
Active bibliography (related documents): More All
0.7: Subset Algebra Lift Operators for 0-1 Integer Programming - Bienstock, Zuckerberg (2002) (Correct)
0.6: Worst-case Comparison of Valid Inequalities for the TSP - Goemans (1995) (Correct)
0.5: Separating Maximally Violated Comb Inequalities in Planar Graphs - Fleischer, Tardos (1997) (Correct)
Similar documents based on text: More All
1.6: Elementary Closures for Integer Programs - Cornuéjols, Li (2000) (Correct)
1.2: On Disjunctive Cuts for Combinatorial Optimization - Letchford (2000) (Correct)
1.1: On the Separation of Maximally Violated mod-k Cuts.. - Caprara, Fischetti.. (1998) (Correct)
BibTeX entry: (Update)
A. Caprara and A. Letchford, On the separation of split cuts and related inequalities, submitted to Mathematical Programming in October http://citeseer.ist.psu.edu/490429.html More
@misc{ caprara-separation,
author = "A. Caprara and A. Letchford",
title = "the separation of split cuts and related inequalities",
text = "A. Caprara and A. Letchford, On the separation of split cuts and related
inequalities, submitted to Mathematical Programming in October",
url = "citeseer.ist.psu.edu/490429.html" }
Citations (may not include all citations):117 A lift-and-project cutting plane algorithm for mixed 0-1 pro.. (context) - Balas, Ceria et al. - 1993
105 A branch-and-cut algorithm for the resolution of large-scale.. (context) - Padberg, Rinaldi - 1991
72 Cones of matrices and set-functions and 0-1 optimization (context) - Lov, Schrijver - 1991
56 Maximum matching and a polyhedron with (context) - Edmonds - 1965
48 Odd minimum cut-sets and b-matchings (context) - Padberg, Rao - 1982
46 the facial structure of set packing polyhedra (context) - Padberg - 1973
44 Outline of an algorithm for integer solutions to linear prog.. (context) - Gomory - 1958
42 Edmonds polytopes and a hierarchy of combinatorial problems (context) - Chv - 1973
27 Polyhedral computations (context) - Padberg, Gr - 1985
25 Expressing combinatorial optimization problems by linear pro.. (context) - Yannakakis - 1991
24 Disjunctive programming (context) - Balas - 1979
18 An algorithm for the mixed-integer problem (context) - Gomory - 1960
18 Disjunctive programming: Properties of the convex hull of fe.. (context) - Balas - 1998
16 Matrices with the Edmonds-Johnson property (context) - Gerards, Schrijver - 1986
16 the separation of maximally violated mod-k cuts - Caprara, Fischetti et al. - 2000
14 the membership problem for the elementary closure of a polyh.. (context) - Eisenbrand - 1999
11 the symmetric travelling salesman problem II: lifting theore.. (context) - Gr, Padberg - 1979
11 atal-Gomory cuts (context) - Caprara, Fischetti et al. - 1996
11 Separating maximally violated comb inequalities in planar gr.. - Fleischer, Tardos - 1999
10 Separating clique tree and bipartition inequalities having a.. (context) - Carr - 1997
7 Solution of large-scale symmetric traveling salesman problem.. (context) - Gr, Holland - 1991
6 Separating a superclass of comb inequalities in planar graph.. (context) - Letchford - 2000
5 Elementary closures for integer programs (context) - Cornu, Li - 2001
5 A recursive procedure to generate all cuts for 0-1 mixed int.. (context) - Nemhauser, Wolsey - 1990
5 Facet identication for the symmetric traveling salesman poly.. (context) - Padberg, Rinaldi - 1990
3 a new type of cutting planes for integer programming (context) - Balas, cuts - 1971
3 Wiley: New York (context) - Nemhauser, Wolsey et al. - 1988
2 atal closures for mixed integer programming problems (context) - Cook, Kannan et al. - 1990
2 the symmetric travelling salesman problem I: inequalities (context) - Gr, Padberg - 1979
2 Wiley: New York (context) - Gr, Lov et al. - 1988
2 On disjunctive cuts for combinatorial optimization - Letchford
Documents on the same site (http://www.or.deis.unibo.it/alberto/online.htm): More
The Multiple Subset Sum Problem - Caprara, Kellerer, Pferschy (1998) (Correct)
A Global Method for Crew Planning in Railway Applications - Caprara, Monaci, Toth (Correct)
Exact Solution of the Quadratic Knapsack Problem - Caprara, Pisinger, Toth (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC