Alper Atamtürk  Home/Search
Context Related
| berkeley.edu/~atamturk/pap...sil2.2.pdf 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: berkeley.edu/~atamturk/pa...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that superadditive lifting functions lead to sequence independent lifting of inequalities for general mixed--integer programming. (Update)
Context of citations to this paper: More
...[29] described the sequential lifting procedure for 0 1 programming. Since then lifting has been studied and used extensively [4, 8, 14, 15, 16, 17, 19, 27, 33, 38, 39, 40, 41], particularly, for 0 1 and mixed 0 1 programming problems. In this section we focus on the use of...
...as well if lower dimensional restrictions are obtained by fixing integer variables to a bound rather than to some intermediate value. Theorem 2. [1] Let # be defined as before and let # : IR IR be a superadditive function such that # #. Then inequality (6) #RxR i#L #(A i )...
Cited by: More
Sequence Independent Lifting for 0-1 Knapsack Problems With.. - Bo Zeng And (Correct)
On Capacitated Network Design Cut-Set Polyhedra - Atamtürk (2001) (Correct)
On The Facets Of The Mixed-Integer Knapsack Polyhedron - Atamtürk (2002) (Correct)
Active bibliography (related documents): More All
0.5: Cover and Pack Inequalities for (Mixed) Integer Programming - Atamtürk (Correct)
0.3: A Directed Cycle based Column-and-Cut Generation Method for.. - Rajan, Atamtürk (2003) (Correct)
0.3: Aggregation and Mixed Integer Rounding to Solve MIPs - Marchand, Wolsey (1998) (Correct)
Similar documents based on text: More All
0.9: Sequence Independent Lifting in Mixed Integer Programming - Gu, Nemhauser, Savelsbergh (1998) (Correct)
0.7: Lifted Flow Pack Facets of the Single Node Fixed-Charge Flow.. - Atamtürk (1999) (Correct)
0.6: Valid Inequalities for Problems With Additive Variable .. - Atamtürk, Nemhauser.. (1999) (Correct)
Related documents from co-citation: More All
4: Sequence independent lifting in mixed integer programming - Gu, Nemhauser et al. - 1995
4: Valid inequalities and superadditivity for 0-1 integer programs (context) - Wolsey - 1977
3: Facets of regular 0-1 polytopes (context) - Hammer, Johnson et al. - 1975
BibTeX entry: (Update)
A. Atamturk. Sequence independent lifting for mixed--integer programming. Research Report BCOL.01.02, University of California at Berkeley, May 2001. Available at http://ieor.berkeley.edu/#atamturk. http://citeseer.ist.psu.edu/atamturk02sequence.html More
@misc{ atamturk01sequence,
author = "A. Atamturk",
title = "Sequence independent lifting for mixed--integer programming",
text = "A. Atamturk. Sequence independent lifting for mixed--integer programming.
Research Report BCOL.01.02, University of California at Berkeley, May 2001.
Available at http://ieor.berkeley.edu/#atamturk.",
year = "2001",
url = "citeseer.ist.psu.edu/atamturk02sequence.html" }
Citations (may not include all citations):518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988
27 Annals of Discrete Mathematics (context) - Balas - 1979
18 Facets and strong valid inequalities for integer programs (context) - Wolsey - 1976
18 An algorithm for the mixed integer problem (context) - Gomory - 1960
10 Valid inequalities and superadditivity for 0/1 integer progr.. (context) - Wolsey - 1977
9 Sequence independent lifting in mixed integer programming - Gu, Nemhauser et al. - 2000
8 Aggregation and mixed integer rounding to solve MIPs - Marchand, Wolsey - 2001
8 Chvatal closures for mixed integer programming problems (context) - Cook, Kannan et al. - 1990
7 A recursive procedure for generating all cuts for 0--1 mixed.. (context) - Nemhauser, Wolsey - 1990
5 Elementary closures for integer programs (context) - Cornuejols, Li - 2001
3 the facets of mixed--integer knapsack polyhedron (context) - Atamturk
2 cuts: A variation of Gomory mixed integer cuts from the LP t.. (context) - Cornuejols, Li et al. - 2000
Documents on the same site (http://queue.ieor.berkeley.edu/~atamturk/papers/index.html): More
Lifted Flow Pack Facets of the Single Node Fixed-Charge Flow.. - Atamtürk (1999) (Correct)
Valid Inequalities for Problems With Additive Variable .. - Atamtürk, Nemhauser.. (1999) (Correct)
The Mixed Vertex Packing Problem - Atamtürk, Nemhauser, Savelsbergh (2000) (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