×

zbMATH — the first resource for mathematics

Wolsey, Laurence Alexander

Compute Distance To:
Author ID: wolsey.laurence-a Recent zbMATH articles by "Wolsey, Laurence Alexander"
Published as: Wolsey, L. A.; Wolsey, Laurence; Wolsey, Laurence A.
External Links: MGP · Wikidata · GND
Documents Indexed: 160 Publications since 1971, including 9 Books
all top 5

Co-Authors

35 single-authored
12 Nemhauser, George L.
12 Pochet, Yves
8 Conforti, Michele
8 Di Summa, Marco
7 Dey, Santanu S.
6 Marchand, Hugues
6 Weismantel, Robert
5 Louveaux, Quentin
5 van Roy, Tony J.
4 Aardal, Karen I.
4 Cornuéjols, Gérard P.
4 de Souza, Cid Carvalho
4 Fisher, Marshall L.
4 Liebling, Thomas M.
4 Naddef, Denis J.
4 Rinaldi, Giovanni
4 Van Vyve, Mathieu
4 Vanderbeck, François
4 Yaman, Hande
3 Aghezzaf, El-Houssaine
3 Bárány, Imre
3 Belvaux, Gaetan
3 Martin, Alexander
3 Melo, Rafael A.
3 Padberg, Manfred W.
2 Cordier, Cécile
2 Ferreira, Carlos Eduardo
2 Houndji, Vinasetan Ratheil
2 Jünger, Michael
2 Lodi, Andrea
2 Loparic, Marko
2 Magnanti, Thomas L.
2 Miller, Andrew J.
2 Pulleyblank, William R.
2 Queyranne, Maurice
2 Reinelt, Gerhard
2 Schaus, Pierre
2 Sutter, Alain
2 Tind, Jørgen
2 Tramontani, Andrea
1 Agra, Agostinho
1 Ahmed, Shabbir
1 Andersen, Kent Høj
1 Andersson, Henrik C. M.
1 Anily, Shoshana
1 Anstreicher, Kurt M.
1 Avella, Pasquale
1 Balas, Egon
1 Boccia, Maurizio
1 Bockmayr, Alexander
1 Boissin, Nicolas
1 Bousba, Choaib
1 Bradley, Gordon H.
1 Brahimi, Nadjib
1 Catanzaro, Daniele
1 Cavalcante, Cristina C. B.
1 Ceria, Sebastián
1 Christiansen, Marielle
1 Dash, Sanjeeb
1 Dauzère-Pérès, Stéphane
1 Pinho de Sousa, Jorge
1 Dyer, Martin E.
1 Edmonds, Jeffery
1 Eisenbrand, Friedrich
1 Gabszewicz, Jean J.
1 Gicquel, Celine
1 Gorry, G. Anthony
1 Günlük, Oktay
1 Hammer, Peter Ladislaw
1 Hounkonnou, Mahouton Norbert
1 Keunings, Roland
1 Köppe, Matthias
1 Laundy, Richard S.
1 Minoux, Michel Andre
1 Ortega, Francisco A.
1 Pereira, Olivier
1 Pesenti, Raffaele
1 Pisaruk, Nicolai N.
1 Qiu, Feng
1 Rardin, Ronald L.
1 Richard, Jean-Francois
1 Sadykov, Ruslan
1 Savelsbergh, Martin W. P.
1 Schrage, Linus E.
1 Shapiro, Jeremy Frank
1 Tzur, Michal
1 Van Hentenryck, Pascal
1 van Hoesel, Stan Peter Maria
1 Verweij, Bram
1 Wagelmans, Albert P. M.
1 Wang, Yaolei
1 Yıldız, Sercan
1 Zambelli, Giacomo
1 Zone, O.

Publications by Year

Citations contained in zbMATH Open

138 Publications have been cited 5,354 times in 3,202 Documents Cited by Year
Integer and combinatorial optimization. Zbl 0652.90067
Nemhauser, George L.; Wolsey, Laurence A.
1988
Maximizing submodular set functions: formulations and analysis of algorithms. Zbl 0469.90052
Nemhauser, G. L.; Wolsey, L. A.
392
1981
Integer programming. Zbl 0930.90072
Wolsey, Laurence A.
300
1998
An analysis of approximations for maximizing submodular set functions-I. Zbl 0374.90045
Nemhauser, G. L.; Wolsey, L. A.; Fisher, M. L.
246
1978
Integer and combinatorial optimization. Paperback ed. Zbl 0944.90001
Nemhauser, George L.; Wolsey, Laurence A.
233
1999
Production planning by mixed integer programming. Zbl 1102.90039
Pochet, Yves; Wolsey, Laurence A.
156
2006
The uncapacitated facility location problem. Zbl 0727.90043
Cornuejols, Gerard; Nemhauser, George L.; Wolsey, Laurence A.
104
1990
Faces for a linear inequality in O-1 variables. Zbl 0314.90063
Wolsey, Laurence A.
102
1975
A view of shortest route methods in integer programming. Zbl 0299.90012
Wolsey, L. A.
99
1974
Valid linear inequalities for fixed charge problems. Zbl 0579.90072
Padberg, M. W.; van Roy, T. J.; Wolsey, L. A.
82
1985
Optimal trees. Zbl 0839.90135
Magnanti, Thomas L.; Wolsey, Laurence A.
81
1995
Strong formulations for multi-item capacitated lot sizing. Zbl 0601.90037
Barany, Imre; van Roy, Tony J.; Wolsey, Laurence A.
74
1984
Solving mixed integer programming problems using automatic reformulation. Zbl 0614.90082
van Roy, Tony J.; Wolsey, Laurence A.
72
1987
A recursive procedure to generate all cuts for 0-1 mixed integer programs. Zbl 0735.90049
Nemhauser, George L.; Wolsey, Laurence A.
71
1990
An analysis of the greedy algorithm for the submodular set covering problem. Zbl 0508.68021
Wolsey, Laurence A.
69
1982
Aggregation and mixed integer rounding to solve mips. Zbl 1163.90671
Marchand, Hugues; Wolsey, Laurence A.
68
2001
Uncapacitated lot-sizing: The convex hull of solutions. Zbl 0551.90068
Barany, Imre; van Roy, Tony; Wolsey, Laurence A.
63
1984
A time indexed formulation of non-preemptive single machine scheduling problems. Zbl 0768.90041
Sousa, Jorge P.; Wolsey, Laurence A.
59
1992
Inequalities from two rows of a simplex tableau. Zbl 1136.90517
Andersen, Kent; Louveaux, Quentin; Weismantel, Robert; Wolsey, Laurence A.
58
2007
Formulating the single machine sequencing problem with release dates as a mixed integer program. Zbl 0694.90060
Dyer, Martin E.; Wolsey, Laurence A.
58
1990
An exact algorithm for IP column generation. Zbl 0873.90074
Vanderbeck, François; Wolsey, Laurence A.
51
1996
bc-prod: a specialized branch-and-cut system for lot-sizing problems. Zbl 1231.90384
Belvaux, Gaetan; Wolsey, Laurence A.
50
2000
Heuristic analysis, linear programming and branch and bound. Zbl 0442.90061
Wolsey, Laurence A.
50
1980
Polyhedra for lot-sizing with Wagner-Whitin costs. Zbl 0822.90049
Pochet, Yves; Wolsey, Laurence A.
49
1994
An analysis of approximations for maximizing submodular set functions. II. Zbl 0408.90085
Fisher, M. L.; Nemhauser, G. L.; Wolsey, L. A.
49
1978
Lot-sizing with constant batches: Formulation and valid inequalities. Zbl 0808.90058
Pochet, Yves; Wolsey, Laurence A.
47
1993
Lot-size models with backlogging: Strong reformulations and cutting planes. Zbl 0663.90038
Pochet, Yves; Wolsey, Laurence A.
46
1988
Best algorithms for approximating the maximum of a submodular set function. Zbl 0395.90072
Nemhauser, G. L.; Wolsey, L. A.
45
1978
Modelling practical lot-sizing problems as mixed-integer programs. Zbl 1232.90169
Belvaux, Gaetan; Wolsey, Laurence A.
42
2001
Solving multi-item lot-sizing problems using strong cutting planes. Zbl 0727.90034
Pochet, Yves; Wolsey, Laurence A.
40
1991
Integer programming duality: Price functions and sensitivity analysis. Zbl 0458.90047
Wolsey, Laurence A.
40
1981
Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Zbl 1232.90104
Wolsey, Laurence A.
35
2002
Cutting planes in integer and mixed integer programming. Zbl 1130.90370
Marchand, Hugues; Martin, Alexander; Weismantel, Robert; Wolsey, Laurence
35
2002
The 0-1 knapsack problem with a single continuous variable. Zbl 0956.90021
Marchand, Hugues; Wolsey, Laurence A.
35
1999
Two row mixed-integer cuts via lifting. Zbl 1247.90205
Dey, Santanu S.; Wolsey, Laurence A.
34
2010
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Zbl 1106.90016
Ortega, Francisco; Wolsey, Laurence A.
34
2003
The node capacitated graph partitioning problem: A computational study. Zbl 0919.90139
Ferreira, C. E.; Martin, A.; de Souza, C. C.; Weismantel, R.; Wolsey, L. A.
32
1998
Approximate extended formulations. Zbl 1085.90051
Van Vyve, Mathieu; Wolsey, Laurence A.
31
2006
An elementary survey of general duality theory in mathematical programming. Zbl 0467.90061
Tind, Jorgen; Wolsey, Laurence A.
31
1981
Facets and strong valid inequalities for integer programs. Zbl 0339.90036
Wolsey, Laurence A.
30
1976
Tight formulations for some simple mixed integer programs and convex objective integer programs. Zbl 1047.90035
Miller, Andrew J.; Wolsey, Laurence A.
29
2003
Valid inequalities and superadditivity for 0-1 integer programs. Zbl 0402.90066
Wolsey, L. A.
29
1977
Capacitated facility location: Valid inequalities and facets. Zbl 0846.90088
Aardal, Karen; Pochet, Yves; Wolsey, Laurence A.
28
1995
Reformulation and decomposition of integer programs. Zbl 1187.90207
Vanderbeck, François; Wolsey, Laurence A.
26
2010
Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints. Zbl 0718.90067
Wolsey, Laurence A.
26
1990
Formulations and valid inequalities of the node capacitated graph partitioning problem. Zbl 0855.90131
Ferreira, C. E.; Martin, A.; de Souza, C. C.; Weismantel, R.; Wolsey, L. A.
25
1996
Lot-sizing with production and delivery time windows. Zbl 1111.90078
Wolsey, Laurence A.
24
2006
An analysis of approximations for finding a maximum weight Hamiltonian circuit. Zbl 0412.90070
Fisher, M. L.; Nemhauser, G. L.; Wolsey, L. A.
24
1979
Trees and cuts. Zbl 0522.90095
Padberg, Manfred W.; Wolsey, Laurence A.
23
1983
MIP modelling of changeovers in production planning and scheduling problems. Zbl 0923.90088
Wolsey, Laurence A.
22
1997
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation. Zbl 0835.90052
Pochet, Yves; Wolsey, Laurence A.
22
1995
Maximising real-valued submodular functions: primal and dual heuristics for location problems. Zbl 0498.90024
Wolsey, Laurence A.
22
1982
Coefficient redcuction for inequalities in 0-1 variables. Zbl 0292.90038
Bradley, Gordon H.; Hammer, Peter L.; Wolsey, Laurence
22
1974
50 years of integer programming 1958–2008. From the early years to the state-of-the-art. Papers based on the presentations at the special session at the 12th combinatorial optimization workshop AUSSOIS 2008, Aussois, France January 7–11, 2008. With DVD. Zbl 1181.90003
Jünger, Michael (ed.); Liebling, Thomas M. (ed.); Naddef, Denis (ed.); Nemhauser, George (ed.); Pulleyblank, William (ed.); Reinelt, Gerhard (ed.); Rinaldi, Giovanni (ed.); Wolsey, Laurence (ed.)
21
2010
Progress with single-item lot-sizing. Zbl 0914.90105
Wolsey, Laurence A.
21
1995
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. Zbl 0807.90051
Rardin, Ronald L.; Wolsey, Laurence A.
21
1993
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Zbl 1048.90137
Louveaux, Quentin; Wolsey, Laurence A.
20
2003
The uncapacitated lot-sizing problem with sales and safety stocks. Zbl 0992.90022
Loparic, Marko; Pochet, Yves; Wolsey, Laurence A.
20
2001
Covering linear programming with violations. Zbl 1304.90139
Qiu, Feng; Ahmed, Shabbir; Dey, Santanu S.; Wolsey, Laurence A.
19
2014
Constrained infinite group relaxations of MIPs. Zbl 1211.90142
Dey, Santanu S.; Wolsey, Laurence A.
19
2010
Further facet generating procedures for vertex packing polytopes. Zbl 0348.90148
Wolsey, Laurence A.
19
1976
Two “well-known” properties of subgradient optimization. Zbl 1180.90179
Anstreicher, Kurt M.; Wolsey, Laurence A.
18
2009
Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. Zbl 1143.90359
Dey, Santanu S.; Wolsey, Laurence A.
18
2008
Non-standard approaches to integer programming. Zbl 1130.90364
Aardal, Karen; Weismantel, Robert; Wolsey, Laurence A.
18
2002
Polyhedral characterization of the economic lot-sizing problem with start-up costs. Zbl 0801.90033
van Hoesel, C. P. M.; Wagelmans, A. P. M.; Wolsey, L. A.
18
1994
A maritime inventory routing problem: discrete time formulations and valid inequalities. Zbl 1338.90016
Agra, Agostinho; Andersson, Henrik; Christiansen, Marielle; Wolsey, Laurence
17
2013
Packing and covering a tree by subtrees. Zbl 0642.05042
Bárány, I.; Edmonds, J.; Wolsey, L. A.
17
1986
Valid inequalities and separation for uncapacitated fixed charge networks. Zbl 0575.90045
van Roy, Tony J.; Wolsey, Laurence A.
17
1985
Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates. Zbl 1241.90056
Sadykov, Ruslan; Wolsey, Laurence A.
16
2006
Uncapacitated lot-sizing problems with start-up costs. Zbl 0696.90021
Wolsey, Laurence A.
16
1989
Algorithms and reformulations for lot sizing problems. Zbl 0838.90029
Pochet, Yves; Wolsey, Laurence A.
15
1995
Strong formulations for mixed integer programming: A survey. Zbl 0674.90072
Wolsey, Laurence
15
1989
Submodularity and valid inequalities in capacitated fixed charge networks. Zbl 0674.90027
Wolsey, Laurence A.
15
1989
Uncapacitated two-level lot-sizing. Zbl 1193.90091
Melo, Rafael A.; Wolsey, Laurence A.
13
2010
Tight MIP formulation for multi-item discrete lot-sizing problems. Zbl 1165.90541
Miller, Andrew J.; Wolsey, Laurence A.
13
2003
Cutting planes for integer programs with general integer variables. Zbl 0919.90113
Ceria, Sebastián; Cordier, Cécile; Marchand, Hugues; Wolsey, Laurence A.
13
1998
A canonical representation of simple plant location problems and its applications. Zbl 0501.90032
Cornuejols, Gerard; Nemhauser, George L.; Wolsey, Laurence A.
13
1980
Worst-case and probabilistic analysis of algorithms for a location problem. Zbl 0441.90027
Cornuejols, Gerard; Nemhauser, George L.; Wolsey, Laurence A.
13
1980
Extensions of the group theoretic approach in integer programming. Zbl 0239.90034
Wolsey, Laurence A.
13
1971
Sensitivity analysis for branch and bound integer programming. Zbl 0583.90074
Schrage, Linus; Wolsey, Laurence
12
1985
Network formulations of mixed-integer programs. Zbl 1218.90133
Conforti, Michele; Di Summa, Marco; Eisenbrand, Friedrich; Wolsey, Laurence A.
11
2009
Dynamic knapsack sets and capacitated lot-sizing. Zbl 1030.90102
Loparic, Marko; Marchand, Hugues; Wolsey, Laurence A.
11
2003
\(bc\)-\(opt\): A branch-and-cut code for mixed integer programs. Zbl 0939.90025
Cordier, Cécile; Marchand, Hugues; Laundy, Richard; Wolsey, Laurence A.
11
1999
Optimal placement of add/drop multiplexers: Heuristic and exact algorithms. Zbl 0987.90014
Sutter, Alain; Vanderbeck, François; Wolsey, Laurence
11
1998
On the greedy heuristic for continuous covering and packing problems. Zbl 0512.05017
Fisher, Marshall L.; Wolsey, Laurence A.
11
1982
The b-hull of an integer program. Zbl 0457.90055
Wolsey, L. A.
11
1981
A resource decomposition algorithm for general mathematical programs. Zbl 0449.90085
Wolsey, Laurence A.
11
1981
Experiments with two row tableau cuts. Zbl 1285.90047
Dey, Santanu S.; Lodi, Andrea; Tramontani, Andrea; Wolsey, Laurence A.
10
2010
Multi-item lot-sizing with joint set-up costs. Zbl 1170.90005
Anily, Shoshana; Tzur, Michal; Wolsey, Laurence A.
10
2009
Compact formulations as a union of polyhedra. Zbl 1145.90044
Conforti, Michele; Wolsey, Laurence A.
10
2008
Lot-sizing on a tree. Zbl 1166.90372
Di Summa, Marco; Wolsey, Laurence A.
10
2008
The mixing set with flows. Zbl 1171.90477
Conforti, Michele; Di Summa, Marco; Wolsey, Laurence A.
10
2007
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Zbl 1157.90488
Louveaux, Quentin; Wolsey, Laurence A.
10
2007
Generalized dynamic programming methods in integer programming. Zbl 0268.90047
Wolsey, Laurence A.
10
1973
Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances. Zbl 1390.90011
Avella, Pasquale; Boccia, Maurizio; Wolsey, Laurence A.
8
2015
Relaxations for two-level multi-item lot-sizing problems. Zbl 1319.90058
Van Vyve, Mathieu; Wolsey, Laurence A.; Yaman, Hande
8
2014
Strong formulations for mixed integer programs: valid inequalities and extended formulations. Zbl 1035.90052
Wolsey, Laurence A.
8
2003
On the practical strength of two-row tableau cuts. Zbl 1356.90090
Dey, Santanu S.; Lodi, Andrea; Tramontani, Andrea; Wolsey, Laurence A.
7
2014
On unions and dominants of polytopes. Zbl 1098.90092
Balas, Egon; Bockmayr, Alexander; Pisaruk, Nicolai; Wolsey, Laurence
7
2004
Combining problem structure with basis reduction to solve a class of hard integer programs. Zbl 1082.90551
Louveaux, Quentin; Wolsey, Laurence A.
7
2002
Convex hull results for the warehouse problem. Zbl 1454.90009
Wolsey, Laurence A.; Yaman, Hande
1
2018
The weighted arborescence constraint. Zbl 06756585
Houndji, Vinasetan Ratheil; Schaus, Pierre; Hounkonnou, Mahouton Norbert; Wolsey, Laurence
2
2017
Tight MIP formulations for bounded up/down times and interval-dependent start-ups. Zbl 1373.90077
Queyranne, Maurice; Wolsey, Laurence A.
2
2017
Erratum to: “A tight formulation for uncapacitated lot-sizing with stock upper bounds”. Zbl 06680643
Wolsey, Laurence A.
1
2017
Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances. Zbl 1390.90011
Avella, Pasquale; Boccia, Maurizio; Wolsey, Laurence A.
8
2015
Sufficiency of cut-generating functions. Zbl 1327.90132
Cornuéjols, Gérard; Wolsey, Laurence; Yıldız, Sercan
4
2015
Covering linear programming with violations. Zbl 1304.90139
Qiu, Feng; Ahmed, Shabbir; Dey, Santanu S.; Wolsey, Laurence A.
19
2014
Relaxations for two-level multi-item lot-sizing problems. Zbl 1319.90058
Van Vyve, Mathieu; Wolsey, Laurence A.; Yaman, Hande
8
2014
On the practical strength of two-row tableau cuts. Zbl 1356.90090
Dey, Santanu S.; Lodi, Andrea; Tramontani, Andrea; Wolsey, Laurence A.
7
2014
A maritime inventory routing problem: discrete time formulations and valid inequalities. Zbl 1338.90016
Agra, Agostinho; Andersson, Henrik; Christiansen, Marielle; Wolsey, Laurence
17
2013
MIP formulations and heuristics for two-level production-transportation problems. Zbl 1251.90058
Melo, Rafael A.; Wolsey, Laurence A.
6
2012
On discrete lot-sizing and scheduling on identical parallel machines. Zbl 1258.90038
Gicquel, C.; Wolsey, L. A.; Minoux, M.
2
2012
Mixing sets linked by bidirected paths. Zbl 1242.90129
Di Summa, Marco; Wolsey, Laurence A.
4
2011
Two row mixed-integer cuts via lifting. Zbl 1247.90205
Dey, Santanu S.; Wolsey, Laurence A.
34
2010
Reformulation and decomposition of integer programs. Zbl 1187.90207
Vanderbeck, François; Wolsey, Laurence A.
26
2010
50 years of integer programming 1958–2008. From the early years to the state-of-the-art. Papers based on the presentations at the special session at the 12th combinatorial optimization workshop AUSSOIS 2008, Aussois, France January 7–11, 2008. With DVD. Zbl 1181.90003
Jünger, Michael (ed.); Liebling, Thomas M. (ed.); Naddef, Denis (ed.); Nemhauser, George (ed.); Pulleyblank, William (ed.); Reinelt, Gerhard (ed.); Rinaldi, Giovanni (ed.); Wolsey, Laurence (ed.)
21
2010
Constrained infinite group relaxations of MIPs. Zbl 1211.90142
Dey, Santanu S.; Wolsey, Laurence A.
19
2010
Uncapacitated two-level lot-sizing. Zbl 1193.90091
Melo, Rafael A.; Wolsey, Laurence A.
13
2010
Experiments with two row tableau cuts. Zbl 1285.90047
Dey, Santanu S.; Lodi, Andrea; Tramontani, Andrea; Wolsey, Laurence A.
10
2010
Composite lifting of group inequalities and an application to two-row mixing inequalities. Zbl 1242.90128
Dey, Santanu S.; Wolsey, Laurence A.
6
2010
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times. Zbl 1179.90104
Brahimi, Nadjib; Dauzere-Peres, Stéphane; Wolsey, Laurence A.
6
2010
Projecting an extended formulation for mixed-integer covers on bipartite graphs. Zbl 1218.90134
Conforti, Michele; Wolsey, Laurence A.; Zambelli, Giacomo
5
2010
Single item lot-sizing with non-decreasing capacities. Zbl 1190.90108
Pochet, Yves; Wolsey, Laurence A.
5
2010
Lattice based extended formulations for integer linear equality systems. Zbl 1184.90104
Aardal, Karen; Wolsey, Laurence A.
3
2010
Optimizing production and transportation in a commit-to-delivery business mode. Zbl 1177.90041
Melo, Rafael A.; Wolsey, Laurence A.
3
2010
Lot-sizing with stock upper bounds and fixed charges. Zbl 1218.90136
Di Summa, Marco; Wolsey, Laurence A.
2
2010
Two “well-known” properties of subgradient optimization. Zbl 1180.90179
Anstreicher, Kurt M.; Wolsey, Laurence A.
18
2009
Network formulations of mixed-integer programs. Zbl 1218.90133
Conforti, Michele; Di Summa, Marco; Eisenbrand, Friedrich; Wolsey, Laurence A.
11
2009
Multi-item lot-sizing with joint set-up costs. Zbl 1170.90005
Anily, Shoshana; Tzur, Michal; Wolsey, Laurence A.
10
2009
Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. Zbl 1143.90359
Dey, Santanu S.; Wolsey, Laurence A.
18
2008
Compact formulations as a union of polyhedra. Zbl 1145.90044
Conforti, Michele; Wolsey, Laurence A.
10
2008
Lot-sizing on a tree. Zbl 1166.90372
Di Summa, Marco; Wolsey, Laurence A.
10
2008
The mixing set with divisible capacities. Zbl 1143.90362
Conforti, Michele; Di Summa, Marco; Wolsey, Laurence A.
6
2008
Inequalities from two rows of a simplex tableau. Zbl 1136.90517
Andersen, Kent; Louveaux, Quentin; Weismantel, Robert; Wolsey, Laurence A.
58
2007
The mixing set with flows. Zbl 1171.90477
Conforti, Michele; Di Summa, Marco; Wolsey, Laurence A.
10
2007
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Zbl 1157.90488
Louveaux, Quentin; Wolsey, Laurence A.
10
2007
The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows. Zbl 1136.90402
Conforti, Michele; Di Summa, Marco; Wolsey, Laurence A.
4
2007
Production planning by mixed integer programming. Zbl 1102.90039
Pochet, Yves; Wolsey, Laurence A.
156
2006
Approximate extended formulations. Zbl 1085.90051
Van Vyve, Mathieu; Wolsey, Laurence A.
31
2006
Lot-sizing with production and delivery time windows. Zbl 1111.90078
Wolsey, Laurence A.
24
2006
Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates. Zbl 1241.90056
Sadykov, Ruslan; Wolsey, Laurence A.
16
2006
On unions and dominants of polytopes. Zbl 1098.90092
Balas, Egon; Bockmayr, Alexander; Pisaruk, Nicolai; Wolsey, Laurence
7
2004
On the cut polyhedron. Zbl 1045.90049
Conforti, Michele; Rinaldi, Giovanni; Wolsey, Laurence
5
2004
Extended formulations for Gomory corner polyhedra. Zbl 1087.90050
Köppe, Matthias; Louveaux, Quentin; Weismantel, Robert; Wolsey, Laurence A.
3
2004
Uncapacitated lot-sizing with buying, sales and backlogging. Zbl 1140.90383
Verweij, Bram; Wolsey, Laurence A.
1
2004
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Zbl 1106.90016
Ortega, Francisco; Wolsey, Laurence A.
34
2003
Tight formulations for some simple mixed integer programs and convex objective integer programs. Zbl 1047.90035
Miller, Andrew J.; Wolsey, Laurence A.
29
2003
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Zbl 1048.90137
Louveaux, Quentin; Wolsey, Laurence A.
20
2003
Tight MIP formulation for multi-item discrete lot-sizing problems. Zbl 1165.90541
Miller, Andrew J.; Wolsey, Laurence A.
13
2003
Dynamic knapsack sets and capacitated lot-sizing. Zbl 1030.90102
Loparic, Marko; Marchand, Hugues; Wolsey, Laurence A.
11
2003
Strong formulations for mixed integer programs: valid inequalities and extended formulations. Zbl 1035.90052
Wolsey, Laurence A.
8
2003
Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Zbl 1232.90104
Wolsey, Laurence A.
35
2002
Cutting planes in integer and mixed integer programming. Zbl 1130.90370
Marchand, Hugues; Martin, Alexander; Weismantel, Robert; Wolsey, Laurence
35
2002
Non-standard approaches to integer programming. Zbl 1130.90364
Aardal, Karen; Weismantel, Robert; Wolsey, Laurence A.
18
2002
Combining problem structure with basis reduction to solve a class of hard integer programs. Zbl 1082.90551
Louveaux, Quentin; Wolsey, Laurence A.
7
2002
Aggregation and mixed integer rounding to solve mips. Zbl 1163.90671
Marchand, Hugues; Wolsey, Laurence A.
68
2001
Modelling practical lot-sizing problems as mixed-integer programs. Zbl 1232.90169
Belvaux, Gaetan; Wolsey, Laurence A.
42
2001
The uncapacitated lot-sizing problem with sales and safety stocks. Zbl 0992.90022
Loparic, Marko; Pochet, Yves; Wolsey, Laurence A.
20
2001
Scheduling projects with labor constraints. Zbl 0984.90012
Cavalcante, C. C. B.; de Souza, C. Carvalho; Savelsbergh, M. W. P.; Wang, Y.; Wolsey, L. A.
5
2001
On the Wagner-Whitin lot-sizing polyhedron. Zbl 1073.90575
Pereira, Olivier; Wolsey, Laurence
2
2001
bc-prod: a specialized branch-and-cut system for lot-sizing problems. Zbl 1231.90384
Belvaux, Gaetan; Wolsey, Laurence A.
50
2000
Integer and combinatorial optimization. Paperback ed. Zbl 0944.90001
Nemhauser, George L.; Wolsey, Laurence A.
233
1999
The 0-1 knapsack problem with a single continuous variable. Zbl 0956.90021
Marchand, Hugues; Wolsey, Laurence A.
35
1999
\(bc\)-\(opt\): A branch-and-cut code for mixed integer programs. Zbl 0939.90025
Cordier, Cécile; Marchand, Hugues; Laundy, Richard; Wolsey, Laurence A.
11
1999
Integer programming. Zbl 0930.90072
Wolsey, Laurence A.
300
1998
The node capacitated graph partitioning problem: A computational study. Zbl 0919.90139
Ferreira, C. E.; Martin, A.; de Souza, C. C.; Weismantel, R.; Wolsey, L. A.
32
1998
Cutting planes for integer programs with general integer variables. Zbl 0919.90113
Ceria, Sebastián; Cordier, Cécile; Marchand, Hugues; Wolsey, Laurence A.
13
1998
Optimal placement of add/drop multiplexers: Heuristic and exact algorithms. Zbl 0987.90014
Sutter, Alain; Vanderbeck, François; Wolsey, Laurence
11
1998
Optimal placement of add/drop multiplexers: Static and dynamic models. Zbl 0943.90009
Belvaux, Gaetan; Boissin, Nicolas; Sutter, Alain; Wolsey, Laurence A.
5
1998
MIP modelling of changeovers in production planning and scheduling problems. Zbl 0923.90088
Wolsey, Laurence A.
22
1997
An exact algorithm for IP column generation. Zbl 0873.90074
Vanderbeck, François; Wolsey, Laurence A.
51
1996
Formulations and valid inequalities of the node capacitated graph partitioning problem. Zbl 0855.90131
Ferreira, C. E.; Martin, A.; de Souza, C. C.; Weismantel, R.; Wolsey, L. A.
25
1996
Erratum: Capacitated facility location: Valid inequalities and facets. Zbl 0856.90063
Aardal, Karen; Pochet, Yves; Wolsey, Laurence A.
3
1996
Optimal trees. Zbl 0839.90135
Magnanti, Thomas L.; Wolsey, Laurence A.
81
1995
Capacitated facility location: Valid inequalities and facets. Zbl 0846.90088
Aardal, Karen; Pochet, Yves; Wolsey, Laurence A.
28
1995
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation. Zbl 0835.90052
Pochet, Yves; Wolsey, Laurence A.
22
1995
Progress with single-item lot-sizing. Zbl 0914.90105
Wolsey, Laurence A.
21
1995
Algorithms and reformulations for lot sizing problems. Zbl 0838.90029
Pochet, Yves; Wolsey, Laurence A.
15
1995
Optimizing constrained subtrees of trees. Zbl 0846.90114
Aghezzaf, El Houssaine; Magnanti, Thomas L.; Wolsey, Laurence A.
5
1995
Polyhedra for lot-sizing with Wagner-Whitin costs. Zbl 0822.90049
Pochet, Yves; Wolsey, Laurence A.
49
1994
Polyhedral characterization of the economic lot-sizing problem with start-up costs. Zbl 0801.90033
van Hoesel, C. P. M.; Wagelmans, A. P. M.; Wolsey, L. A.
18
1994
A new approach to minimising the frontwidth in finite element calculations. Zbl 0846.73061
de Souza, C. C.; Keunings, R.; Wolsey, L. A.; Zone, O.
7
1994
Modelling piecewise linear concave costs in a tree partitioning problem. Zbl 0798.90111
Aghezzaf, El Houssaine; Wolsey, Laurence A.
5
1994
Lot-sizing with constant batches: Formulation and valid inequalities. Zbl 0808.90058
Pochet, Yves; Wolsey, Laurence A.
47
1993
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. Zbl 0807.90051
Rardin, Ronald L.; Wolsey, Laurence A.
21
1993
A time indexed formulation of non-preemptive single machine scheduling problems. Zbl 0768.90041
Sousa, Jorge P.; Wolsey, Laurence A.
59
1992
Valid inequalities for the Lasdon-Terjung production model. Zbl 0756.90047
Vanderbeck, François; Wolsey, Laurence A.
3
1992
Lot-sizing polyhedra with a cardinality constraint. Zbl 0764.90064
Aghezzaf, El Houssaine; Wolsey, Laurence A.
3
1992
Solving multi-item lot-sizing problems using strong cutting planes. Zbl 0727.90034
Pochet, Yves; Wolsey, Laurence A.
40
1991
Finding minimum cost directed trees with demands and capacities. Zbl 0783.90035
Bousba, Choaib; Wolsey, Laurence A.
3
1991
The uncapacitated facility location problem. Zbl 0727.90043
Cornuejols, Gerard; Nemhauser, George L.; Wolsey, Laurence A.
104
1990
A recursive procedure to generate all cuts for 0-1 mixed integer programs. Zbl 0735.90049
Nemhauser, George L.; Wolsey, Laurence A.
71
1990
Formulating the single machine sequencing problem with release dates as a mixed integer program. Zbl 0694.90060
Dyer, Martin E.; Wolsey, Laurence A.
58
1990
Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints. Zbl 0718.90067
Wolsey, Laurence A.
26
1990
Formulating single machine scheduling problems with precedence constraints. Zbl 0716.90051
Wolsey, Laurence A.
2
1990
Uncapacitated lot-sizing problems with start-up costs. Zbl 0696.90021
Wolsey, Laurence A.
16
1989
Strong formulations for mixed integer programming: A survey. Zbl 0674.90072
Wolsey, Laurence
15
1989
Submodularity and valid inequalities in capacitated fixed charge networks. Zbl 0674.90027
Wolsey, Laurence A.
15
1989
Integer and combinatorial optimization. Zbl 0652.90067
Nemhauser, George L.; Wolsey, Laurence A.
1988
Lot-size models with backlogging: Strong reformulations and cutting planes. Zbl 0663.90038
Pochet, Yves; Wolsey, Laurence A.
46
1988
...and 38 more Documents
all top 5

Cited by 4,433 Authors

70 Wolsey, Laurence Alexander
36 Nemhauser, George L.
34 Cornuéjols, Gérard P.
27 Sherali, Hanif D.
26 Ahmed, Shabbir
23 Escudero, Laureano Fernando
22 Günlük, Oktay
21 Agra, Agostinho
21 Dey, Santanu S.
21 Gouveia, Luis
20 Dash, Sanjeeb
19 Weismantel, Robert
17 Atamtürk, Alper
17 Basu, Amitabh
17 Conforti, Michele
17 Laporte, Gilbert
16 Dahl, Geir
16 Minoux, Michel Andre
15 Boland, Natashia L.
15 Labbé, Martine V.
15 Letchford, Adam N.
15 Smith, J. Cole
15 Yaman, Hande
14 Almada-Lobo, Bernardo
14 Bard, Jonathan F.
14 Constantino, Miguel Fragoso
14 Jans, Raf
14 Luedtke, James R.
14 Margot, François
14 Pardalos, Panos M.
14 Wu, Weili
13 Balas, Egon
13 Fernández, Elena
13 Fischetti, Matteo
13 Grossmann, Ignacio E.
13 Küçükyavuz, Simge
13 Marín, Alfredo
13 Park, Sungsoo
13 Schaefer, Andrew J.
12 Contreras, Iván A.
12 Cordeau, Jean-François
12 Kedad-Sidhoum, Safia
12 Martin, Alexander
12 Padberg, Manfred W.
12 Spieksma, Frits C. R.
12 Van Vyve, Mathieu
12 Vielma, Juan Pablo
12 Xu, Dachuan
11 Berman, Oded
11 Dauzère-Pérès, Stéphane
11 de Souza, Cid Carvalho
11 Gendron, Bernard
11 Guan, Yongpei
11 Klabjan, Diego
11 Koster, Arie M. C. A.
11 Richard, Jean-Philippe Pascal
11 Savelsbergh, Martin W. P.
11 Scheithauer, Guntram
11 Subramani, Krishnan
11 Williamson, David P.
10 Aardal, Karen I.
10 Absi, Nabil
10 Du, Ding-Zhu
10 Glover, Fred W.
10 Hanafi, Saïd
10 Jaumard, Brigitte
10 Kortsarz, Guy
10 Lee, Kyungsik
10 Ljubić, Ivana
10 Lodi, Andrea
10 Morabito, Reinaldo
10 Pérez, Gloria
10 Woeginger, Gerhard Johannes
10 Wu, Tao
9 Akartunalı, Kerem
9 Berthold, Timo
9 Bienstock, Daniel
9 Boccia, Maurizio
9 Bonami, Pierre
9 Caprara, Alberto
9 Del Pia, Alberto
9 Escalante, Mariana S.
9 Fukasawa, Ricardo
9 Gicquel, Celine
9 Jörnsten, Kurt O.
9 Köppe, Matthias
9 Lee, Jon
9 Lee, Youngho
9 Louveaux, Quentin
9 Magnanti, Thomas L.
9 Molinaro, Marco
9 Pfetsch, Marc E.
9 Pochet, Yves
9 Salles da Cunha, Alexandre
9 Sawik, Tadeusz J.
9 Shmoys, David B.
9 Zhang, Zhao
8 Araceli Garín, María
8 Avella, Pasquale
8 Campêlo, Manoel B.
...and 4,333 more Authors
all top 5

Cited in 240 Serials

556 European Journal of Operational Research
284 Computers & Operations Research
265 Mathematical Programming. Series A. Series B
193 Operations Research Letters
191 Discrete Applied Mathematics
151 Annals of Operations Research
92 Discrete Optimization
57 Journal of Global Optimization
53 Theoretical Computer Science
45 Optimization Letters
43 Computational Optimization and Applications
42 Journal of Combinatorial Optimization
40 Networks
38 Journal of Scheduling
35 INFORMS Journal on Computing
32 Naval Research Logistics
29 Algorithmica
28 Journal of Optimization Theory and Applications
26 Mathematical Programming Computation
25 Information Processing Letters
24 RAIRO. Operations Research
23 SIAM Journal on Optimization
22 Discrete Mathematics
22 Mathematics of Operations Research
22 Mathematical and Computer Modelling
21 International Journal of Production Research
20 Mathematical Programming
18 Operations Research
18 Optimization
18 Mathematical Methods of Operations Research
17 Top
17 4OR
16 Automatica
15 Optimization and Engineering
15 OR Spectrum
14 Applied Mathematical Modelling
14 EURO Journal on Computational Optimization
13 Applied Mathematics and Computation
13 Optimization Methods & Software
12 Journal of Computer and System Sciences
12 SIAM Journal on Discrete Mathematics
12 Journal of Heuristics
11 Computers & Mathematics with Applications
10 Artificial Intelligence
10 International Journal of Computer Mathematics
10 Linear Algebra and its Applications
10 International Transactions in Operational Research
10 Constraints
9 Information Sciences
8 Asia-Pacific Journal of Operational Research
8 Annals of Mathematics and Artificial Intelligence
8 Computational Management Science
7 Journal of Combinatorial Theory. Series B
7 Mathematical Problems in Engineering
7 Theory of Computing Systems
7 CEJOR. Central European Journal of Operations Research
7 JMMA. Journal of Mathematical Modelling and Algorithms
6 Journal of Computational and Applied Mathematics
6 OR Spektrum
6 Discrete Event Dynamic Systems
6 Journal of Discrete Algorithms
5 Mathematical Social Sciences
5 Journal of Symbolic Computation
5 Queueing Systems
5 Zeitschrift für Operations Research. Serie A: Theorie
5 ZOR. Zeitschrift für Operations Research
5 Journal of Interdisciplinary Mathematics
4 Fuzzy Sets and Systems
4 International Journal of Game Theory
4 Journal of Econometrics
4 Opsearch
4 SIAM Journal on Computing
4 Combinatorica
4 Applied Mathematics Letters
4 Automation and Remote Control
4 Data Mining and Knowledge Discovery
4 Structural and Multidisciplinary Optimization
4 Networks and Spatial Economics
4 Discrete Mathematics, Algorithms and Applications
4 Journal of Mathematical Modelling and Algorithms in Operations Research
3 International Journal of Control
3 International Journal of Systems Science
3 Computing
3 SIAM Journal on Control and Optimization
3 Statistica Neerlandica
3 Discrete & Computational Geometry
3 Journal of Parallel and Distributed Computing
3 Computational Geometry
3 Computational Statistics and Data Analysis
3 Complexity
3 Soft Computing
3 Journal of Applied Mathematics and Decision Sciences
3 Nonlinear Analysis. Real World Applications
3 Journal of Machine Learning Research (JMLR)
3 Journal of Industrial and Management Optimization
3 Nonlinear Analysis. Hybrid Systems
3 Pesquisa Operacional
3 Advances in Operations Research
3 Journal of the Operations Research Society of China
2 International Journal of Mathematical Education in Science and Technology
...and 140 more Serials
all top 5

Cited in 45 Fields

2,852 Operations research, mathematical programming (90-XX)
425 Computer science (68-XX)
296 Combinatorics (05-XX)
191 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
115 Numerical analysis (65-XX)
110 Convex and discrete geometry (52-XX)
64 Calculus of variations and optimal control; optimization (49-XX)
60 Statistics (62-XX)
49 Systems theory; control (93-XX)
38 Biology and other natural sciences (92-XX)
17 Probability theory and stochastic processes (60-XX)
16 Linear and multilinear algebra; matrix theory (15-XX)
15 Information and communication theory, circuits (94-XX)
10 Mechanics of deformable solids (74-XX)
8 Mathematical logic and foundations (03-XX)
7 Number theory (11-XX)
6 History and biography (01-XX)
5 Commutative algebra (13-XX)
4 Algebraic geometry (14-XX)
4 Real functions (26-XX)
4 Dynamical systems and ergodic theory (37-XX)
4 Approximations and expansions (41-XX)
4 Geometry (51-XX)
3 Group theory and generalizations (20-XX)
3 Functional analysis (46-XX)
3 Operator theory (47-XX)
3 Statistical mechanics, structure of matter (82-XX)
3 Geophysics (86-XX)
2 General and overarching topics; collections (00-XX)
2 Order, lattices, ordered algebraic structures (06-XX)
2 Field theory and polynomials (12-XX)
2 Partial differential equations (35-XX)
2 Algebraic topology (55-XX)
2 Global analysis, analysis on manifolds (58-XX)
1 General algebraic systems (08-XX)
1 Functions of a complex variable (30-XX)
1 Potential theory (31-XX)
1 Ordinary differential equations (34-XX)
1 Harmonic analysis on Euclidean spaces (42-XX)
1 Integral equations (45-XX)
1 General topology (54-XX)
1 Manifolds and cell complexes (57-XX)
1 Mechanics of particles and systems (70-XX)
1 Quantum theory (81-XX)
1 Mathematics education (97-XX)

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.