Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurence A. Wolsey
Person information
- affiliation: Catholic University of Louvain, Belgium
- award (2012): John von Neumann Theory Prize
- award (1989): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j117]Agostinho Agra
, Marielle Christiansen, Laurence A. Wolsey:
Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. 297(1): 164-179 (2022)- 2021
- [j116]Laurence A. Wolsey, Hande Yaman:
Convex hull results for generalizations of the constant capacity single node flow set. Math. Program. 187(1): 351-382 (2021) - [j115]Karen Aardal, Andrea Lodi, Andrea Tramontani, Frederik von Heymann, Laurence A. Wolsey:
Lattice Reformulation Cuts. SIAM J. Optim. 31(4): 2539-2557 (2021) - 2020
- [j114]Daniele Catanzaro, Raffaele Pesenti, Laurence A. Wolsey:
On the Balanced Minimum Evolution polytope. Discret. Optim. 36: 100570 (2020)
2010 – 2019
- 2019
- [j113]Vinasétan Ratheil Houndji, Pierre Schaus, Laurence A. Wolsey:
The item dependent stockingcost constraint. Constraints An Int. J. 24(2): 183-209 (2019) - [j112]Michele Conforti, Laurence A. Wolsey:
"Facet" separation with one linear program. Math. Program. 178(1-2): 361-380 (2019) - 2018
- [j111]Laurence A. Wolsey, Hande Yaman:
Convex hull results for the warehouse problem. Discret. Optim. 30: 108-120 (2018) - [j110]Maurice Queyranne, Laurence A. Wolsey:
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons. J. Comb. Optim. 36(1): 90-107 (2018) - [j109]Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey:
Single-Period Cutting Planes for Inventory Routing Problems. Transp. Sci. 52(3): 497-508 (2018) - 2017
- [j108]Laurence A. Wolsey:
Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds. Math. Program. 161(1-2): 603-609 (2017) - [j107]Maurice Queyranne, Laurence A. Wolsey:
Tight MIP formulations for bounded up/down times and interval-dependent start-ups. Math. Program. 164(1-2): 129-155 (2017) - [c13]Vinasétan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence A. Wolsey:
The Weighted Arborescence Constraint. CPAIOR 2017: 185-201 - 2016
- [j106]Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey:
The continuous knapsack set. Math. Program. 155(1-2): 471-496 (2016) - [j105]Laurence A. Wolsey, Hande Yaman:
Continuous knapsack sets with divisible capacities. Math. Program. 156(1-2): 1-20 (2016) - 2015
- [j104]Gérard Cornuéjols, Laurence A. Wolsey, Sercan Yildiz:
Sufficiency of cut-generating functions. Math. Program. 152(1-2): 643-651 (2015) - [j103]Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey:
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. Networks 65(2): 129-138 (2015) - [i1]Maurice Queyranne, Laurence A. Wolsey:
Modeling Poset Convex Subsets. CTW 2015: 165-168 - 2014
- [j102]Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey:
On the Practical Strength of Two-Row Tableau Cuts. INFORMS J. Comput. 26(2): 222-237 (2014) - [j101]Feng Qiu, Shabbir Ahmed, Santanu S. Dey, Laurence A. Wolsey:
Covering Linear Programming with Violations. INFORMS J. Comput. 26(3): 531-546 (2014) - [j100]Mathieu Van Vyve, Laurence A. Wolsey, Hande Yaman:
Relaxations for two-level multi-item lot-sizing problems. Math. Program. 146(1-2): 495-523 (2014) - [c12]Julien M. Hendrickx, Raphaël M. Jungers, Guillaume Vankeerberghen, Laurence A. Wolsey:
An efficient technique for solving the scheduling of appliances in smart-homes. ACC 2014: 1364-1370 - [c11]Vinasétan Ratheil Houndji, Pierre Schaus, Laurence A. Wolsey, Yves Deville:
The StockingCost Constraint. CP 2014: 382-397 - 2013
- [j99]Mathieu Van Vyve, Laurence A. Wolsey:
Strong and compact relaxations in the original space using a compact extended formulation. EURO J. Comput. Optim. 1(1-2): 71-80 (2013) - [j98]Agostinho Agra, Henrik Andersson, Marielle Christiansen, Laurence A. Wolsey:
A maritime inventory routing problem: Discrete time formulations and valid inequalities. Networks 62(4): 297-314 (2013) - 2012
- [j97]Rafael A. Melo, Laurence A. Wolsey:
MIP formulations and heuristics for two-level production-transportation problems. Comput. Oper. Res. 39(11): 2776-2786 (2012) - [j96]Céline Gicquel, Laurence A. Wolsey, Michel Minoux:
On discrete lot-sizing and scheduling on identical parallel machines. Optim. Lett. 6(3): 545-557 (2012) - 2011
- [j95]Marco Di Summa, Laurence A. Wolsey:
Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discret. Math. 25(2): 731-732 (2011) - [j94]Marco Di Summa, Laurence A. Wolsey:
Mixing Sets Linked by Bidirected Paths. SIAM J. Optim. 21(4): 1594-1613 (2011) - 2010
- [j93]Nadjib Brahimi, Stéphane Dauzère-Pérès, Laurence A. Wolsey:
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times. Comput. Oper. Res. 37(1): 182-188 (2010) - [j92]Santanu S. Dey, Laurence A. Wolsey:
Composite lifting of group inequalities and an application to two-row mixing inequalities. Discret. Optim. 7(4): 256-268 (2010) - [j91]Rafael A. Melo, Laurence A. Wolsey:
Optimizing production and transportation in a commit-to-delivery business mode. Eur. J. Oper. Res. 203(3): 614-618 (2010) - [j90]Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli:
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. Math. Oper. Res. 35(3): 603-623 (2010) - [j89]Yves Pochet, Laurence A. Wolsey:
Single item lot-sizing with non-decreasing capacities. Math. Program. 121(1): 123-143 (2010) - [j88]Karen Aardal, Laurence A. Wolsey:
Lattice based extended formulations for integer linear equality systems. Math. Program. 121(2): 337-352 (2010) - [j87]Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124(1-2): 1-6 (2010) - [j86]Santanu S. Dey, Laurence A. Wolsey:
Two row mixed-integer cuts via lifting. Math. Program. 124(1-2): 143-174 (2010) - [j85]Rafael A. Melo, Laurence A. Wolsey:
Uncapacitated two-level lot-sizing. Oper. Res. Lett. 38(4): 241-245 (2010) - [j84]Marco Di Summa, Laurence A. Wolsey:
Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discret. Math. 24(3): 853-875 (2010) - [j83]Santanu S. Dey, Laurence A. Wolsey:
Constrained Infinite Group Relaxations of MIPs. SIAM J. Optim. 20(6): 2890-2912 (2010) - [c10]Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey:
Experiments with Two Row Tableau Cuts. IPCO 2010: 424-437 - [p3]François Vanderbeck, Laurence A. Wolsey:
Reformulation and Decomposition of Integer Programs. 50 Years of Integer Programming 2010: 431-502 - [e3]Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art. Springer 2010, ISBN 978-3-540-68274-5 [contents]
2000 – 2009
- 2009
- [j82]Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey:
Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34(1): 194-209 (2009) - [j81]Shoshana Anily, Michal Tzur, Laurence A. Wolsey:
Multi-item lot-sizing with joint set-up costs. Math. Program. 119(1): 79-94 (2009) - [j80]Kurt M. Anstreicher, Laurence A. Wolsey:
Two "well-known" properties of subgradient optimization. Math. Program. 120(1): 213-220 (2009) - 2008
- [j79]Michele Conforti, Laurence A. Wolsey:
Compact formulations as a union of polyhedra. Math. Program. 114(2): 277-289 (2008) - [j78]Marco Di Summa, Laurence A. Wolsey:
Lot-sizing on a tree. Oper. Res. Lett. 36(1): 7-13 (2008) - [c9]Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
The Mixing Set with Divisible Capacities. IPCO 2008: 435-449 - [c8]Santanu S. Dey, Laurence A. Wolsey:
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. IPCO 2008: 463-475 - [p2]Laurence A. Wolsey:
Mixed Integer Programming. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [j77]Quentin Louveaux, Laurence A. Wolsey:
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Ann. Oper. Res. 153(1): 47-77 (2007) - [j76]Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
The Mixing Set with Flows. SIAM J. Discret. Math. 21(2): 396-407 (2007) - [c7]Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey:
Inequalities from Two Rows of a Simplex Tableau. IPCO 2007: 1-15 - [c6]Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO 2007: 352-366 - [e2]Pascal Van Hentenryck, Laurence A. Wolsey:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings. Lecture Notes in Computer Science 4510, Springer 2007, ISBN 978-3-540-72396-7 [contents] - 2006
- [j75]Ruslan Sadykov, Laurence A. Wolsey:
Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates. INFORMS J. Comput. 18(2): 209-217 (2006) - [j74]Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey:
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. Math. Program. 105(2-3): 157-160 (2006) - [j73]Mathieu Van Vyve, Laurence A. Wolsey:
Approximate extended formulations. Math. Program. 105(2-3): 501-522 (2006) - [j72]Laurence A. Wolsey:
Lot-sizing with production and delivery time windows. Math. Program. 107(3): 471-489 (2006) - 2004
- [j71]Matthias Köppe, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey:
Extended formulations for Gomory Corner polyhedra. Discret. Optim. 1(2): 141-165 (2004) - [j70]Michele Conforti, Giovanni Rinaldi, Laurence A. Wolsey:
On the cut polyhedron. Discret. Math. 277(1-3): 279-285 (2004) - [j69]Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey:
On unions and dominants of polytopes. Math. Program. 99(2): 223-239 (2004) - [j68]Bram Verweij, Laurence A. Wolsey:
Uncapacitated lot-sizing with buying, sales and backlogging. Optim. Methods Softw. 19(3-4): 427-436 (2004) - [p1]Laurence A. Wolsey:
Time for Old and New Faces. The Sharpest Cut 2004: 7-15 - 2003
- [j67]Quentin Louveaux, Laurence A. Wolsey:
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 4OR 1(3): 173-207 (2003) - [j66]Andrew J. Miller, Laurence A. Wolsey:
Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems. Oper. Res. 51(4): 557-565 (2003) - [j65]Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey:
The Aussois 2000 workshop in combinatorial optimization introduction. Math. Program. 94(2-3): 189-191 (2003) - [j64]Marko Loparic, Hugues Marchand, Laurence A. Wolsey:
Dynamic knapsack sets and capacitated lot-sizing. Math. Program. 95(1): 53-69 (2003) - [j63]Laurence A. Wolsey:
Strong formulations for mixed integer programs: valid inequalities and extended formulations. Math. Program. 97(1-2): 423-447 (2003) - [j62]Andrew J. Miller, Laurence A. Wolsey:
Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. 98(1-3): 73-88 (2003) - [j61]Francisco Ortega, Laurence A. Wolsey:
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41(3): 143-158 (2003) - 2002
- [j60]Karen Aardal, Robert Weismantel, Laurence A. Wolsey:
Non-standard approaches to integer programming. Discret. Appl. Math. 123(1-3): 5-74 (2002) - [j59]Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence A. Wolsey:
Cutting planes in integer and mixed integer programming. Discret. Appl. Math. 123(1-3): 397-446 (2002) - [j58]Laurence A. Wolsey:
Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation. Manag. Sci. 48(12): 1587-1602 (2002) - [j57]Quentin Louveaux, Laurence A. Wolsey:
Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs. Math. Oper. Res. 27(3): 470-484 (2002) - [c5]Jean-François Macq, Laurence A. Wolsey, Benoît Macq:
A rendezvous point selection algorithm for videoconferencing applications. ICME (1) 2002: 689-692 - 2001
- [j56]Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey:
Scheduling projects with labor constraints. Discret. Appl. Math. 112(1-3): 27-52 (2001) - [j55]Hugues Marchand, Laurence A. Wolsey:
Aggregation and Mixed Integer Rounding to Solve MIPs. Oper. Res. 49(3): 363-371 (2001) - [j54]Gaetan Belvaux, Laurence A. Wolsey:
Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs. Manag. Sci. 47(7): 993-1007 (2001) - [j53]Olivier Pereira, Laurence A. Wolsey:
On the Wagner-Whitin Lot-Sizing Polyhedron. Math. Oper. Res. 26(3): 591-600 (2001) - [j52]Marko Loparic, Yves Pochet, Laurence A. Wolsey:
The uncapacitated lot-sizing problem with sales and safety stocks. Math. Program. 89(3): 487-504 (2001)
1990 – 1999
- 1999
- [j51]Hugues Marchand, Laurence A. Wolsey:
The 0-1 Knapsack problem with a single continuous variable. Math. Program. 85(1): 15-33 (1999) - [j50]Cécile Cordier, Hugues Marchand, Richard Laundy, Laurence A. Wolsey:
bc - opt : a branch-and-cut code for mixed integer programs. Math. Program. 86(2): 335-353 (1999) - 1998
- [j49]Gaetan Belvaux, Nicolas Boissin, Alain S. Sutter, Laurence A. Wolsey:
Optimal placement of add /drop multiplexers static and dynamic models. Eur. J. Oper. Res. 108(1): 26-35 (1998) - [j48]Alain S. Sutter, François Vanderbeck, Laurence A. Wolsey:
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms. Oper. Res. 46(5): 719-728 (1998) - [j47]Sebastián Ceria, Cécile Cordier, Hugues Marchand, Laurence A. Wolsey:
Cutting planes for integer programs with general integer variables. Math. Program. 81: 201-214 (1998) - [j46]Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey:
The node capacitated graph partitioning problem: A computational study. Math. Program. 81: 229-256 (1998) - 1997
- [c4]Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey:
Decomposition of Integer Programs and of Generating Sets. ESA 1997: 92-102 - 1996
- [j45]Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey:
Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. 74: 247-266 (1996) - [j44]François Vanderbeck, Laurence A. Wolsey:
An exact algorithm for IP column generation. Oper. Res. Lett. 19(4): 151-159 (1996) - 1995
- [j43]Yves Pochet, Laurence A. Wolsey:
Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation. Discret. Appl. Math. 59(1): 57-74 (1995) - [j42]Karen Aardal, Yves Pochet, Laurence A. Wolsey:
Capacitated Facility Location: Valid Inequalities and Facets. Math. Oper. Res. 20(3): 562-582 (1995) - [j41]El Houssaine Aghezzaf, Thomas L. Magnanti, Laurence A. Wolsey:
Optimizing constrained subtrees of trees. Math. Program. 71: 113-126 (1995) - 1994
- [j40]El Houssaine Aghezzaf, Laurence A. Wolsey:
Modelling piecewise linear concave costs in a tree partitioning problem. Discret. Appl. Math. 50(2): 101-109 (1994) - [j39]Yves Pochet, Laurence A. Wolsey:
Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Program. 67: 297-323 (1994) - [j38]C. P. M. van Hoesel, Albert P. M. Wagelmans, Laurence A. Wolsey:
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs. SIAM J. Discret. Math. 7(1): 141-151 (1994) - 1993
- [j37]Yves Pochet, Laurence A. Wolsey:
Lot-Sizing with Constant Batches: Formulation and Valid Inequalities. Math. Oper. Res. 18(4): 767-785 (1993) - [c3]Yves Pochet, Laurence A. Wolsey:
Algorithms and reformulations for lot sizing problems. Combinatorial Optimization 1993: 245-293 - [c2]Denis Vanderstraeten, O. Zone, R. Keunings, Laurence A. Wolsey:
Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations. PPSC 1993: 929-932 - [e1]Giovanni Rinaldi, Laurence A. Wolsey:
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993. CIACO 1993 [contents] - 1992
- [j36]Laurence A. Wolsey:
Book review. ZOR Methods Model. Oper. Res. 36(1): 92 (1992) - [j35]Jorge P. Sousa, Laurence A. Wolsey:
A time indexed formulation of non-preemptive single machine scheduling problems. Math. Program. 54: 353-367 (1992) - [j34]El Houssaine Aghezzaf, Laurence A. Wolsey:
Lot-sizing polyhedra with a cardinality constraint. Oper. Res. Lett. 11(1): 13-18 (1992) - [c1]Yves Pochet, Laurence A. Wolsey:
Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems. IPCO 1992: 150-164 - 1991
- [j33]Choaib Bousba, Laurence A. Wolsey:
Finding minimum cost directed trees with demands and capacities. Ann. Oper. Res. 33(4): 285-303 (1991) - 1990
- [j32]Martin E. Dyer, Laurence A. Wolsey:
Formulating the single machine sequencing problem with release dates as a mixed integer program. Discret. Appl. Math. 26(2-3): 255-270 (1990) - [j31]Laurence A. Wolsey:
Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints. Discret. Appl. Math. 29(2-3): 251-261 (1990) - [j30]George L. Nemhauser, Laurence A. Wolsey:
A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs. Math. Program. 46: 379-390 (1990)
1980 – 1989
- 1989
- [j29]Laurence A. Wolsey:
Uncapacitated Lot-Sizing Problems with Start-Up Costs. Oper. Res. 37(5): 741-747 (1989) - [j28]Laurence A. Wolsey:
Strong formulations for mixed integer programming: A survey. Math. Program. 45(1-3): 173-191 (1989) - 1988
- [b1]George L. Nemhauser, Laurence A. Wolsey:
Integer and Combinatorial Optimization. Wiley interscience series in discrete mathematics and optimization, Wiley 1988, ISBN 978-0-471-82819-8, pp. I-XIV, 1-763 - [j27]Yves Pochet, Laurence A. Wolsey:
Lot-size models with backlogging: Strong reformulations and cutting planes. Math. Program. 40(1-3): 317-335 (1988) - 1987
- [j26]Tony J. Van Roy, Laurence A. Wolsey:
Solving Mixed Integer Programming Problems Using Automatic Reformulation. Oper. Res. 35(1): 45-57 (1987) - 1986
- [j25]Imre Bárány, Jack Edmonds, Laurence A. Wolsey:
Packing and covering a tree by subtrees. Comb. 6(3): 221-233 (1986) - [j24]Tony J. Van Roy, Laurence A. Wolsey:
Valid inequalities for mixed 0-1 programs. Discret. Appl. Math. 14(2): 199-213 (1986) - 1985
- [j23]Manfred W. Padberg, Tony J. Van Roy, Laurence A. Wolsey:
Valid Linear Inequalities for Fixed Charge Problems. Oper. Res. 33(4): 842-861 (1985) - [j22]Linus Schrage, Laurence A. Wolsey:
Sensitivity Analysis for Branch and Bound Integer Programming. Oper. Res. 33(5): 1008-1023 (1985) - 1984
- [j21]Manfred Padberg, Laurence A. Wolsey:
Fractional covers for forests and matchings. Math. Program. 29(1): 1-14 (1984) - 1982
- [j20]