default search action
Laurence 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
- 2023
- [j119]Dieter Weninger
, Laurence A. Wolsey
Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing. Eur. J. Oper. Res. 310(1): 84-99 (2023) - [j118]Karen I. Aardal
A study of lattice reformulations for integer programming. Oper. Res. Lett. 51(4): 401-407 (2023) - 2022
- [j117]Agostinho Agra
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 I. 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
On the Balanced Minimum Evolution polytope. Discret. Optim. 36: 100570 (2020)
2010 – 2019
- 2019
- [j113]Vinasétan Ratheil Houndji
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
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
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
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
On the Practical Strength of Two-Row Tableau Cuts. INFORMS J. Comput. 26(2): 222-237 (2014) - [j101]Feng Qiu
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
A maritime inventory routing problem: Discrete time formulations and valid inequalities. Networks 62(4): 297-314 (2013) - 2012
- [j97]Rafael A. Melo
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
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
Composite lifting of group inequalities and an application to two-row mixing inequalities. Discret. Optim. 7(4): 256-268 (2010) - [j91]Rafael A. Melo
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 I. 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
Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124(1-2): 1-6 (2010) - [j86]Santanu S. Dey
Two row mixed-integer cuts via lifting. Math. Program. 124(1-2): 143-174 (2010) - [j85]Rafael A. Melo
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
Constrained Infinite Group Relaxations of MIPs. SIAM J. Optim. 20(6): 2890-2912 (2010) - [c10]Santanu S. Dey
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
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
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
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
Extended formulations for Gomory Corner polyhedra. Discret. Optim. 1(2): 141-165 (2004) - [j70]Michele Conforti, Giovanni Rinaldi
On the cut polyhedron. Discret. Math. 277(1-3): 279-285 (2004) - [j69]Egon Balas, Alexander Bockmayr
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 I. 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
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
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
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
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 I. 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
Optimizing constrained subtrees of trees. Math. Program. 71: 113-126 (1995) - 1994
- [j40]El Houssaine Aghezzaf
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
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
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
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]Laurence A. Wolsey:
An analysis of the greedy algorithm for the submodular set covering problem. Comb. 2(4): 385-393 (1982) - [j19]Laurence A. Wolsey:
Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems. Math. Oper. Res. 7(3): 410-425 (1982) - [j18]Jørgen Tind, Laurence A. Wolsey:
On the use of penumbras in blocking and antiblocking theory. Math. Program. 22(1): 71-81 (1982) - 1981
- [j17]Laurence A. Wolsey:
The b-hull of an integer program. Discret. Appl. Math. 3(3): 193-201 (1981) - [j16]Laurence A. Wolsey:
Integer programming duality: Price functions and sensitivity analysis. Math. Program. 20(1): 173-195 (1981) - [j15]Jørgen Tind, Laurence A. Wolsey:
An elementary survey of general duality theory in mathematical programming. Math. Program. 21(1): 241-261 (1981) - 1980
- [j14]Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey:
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem. Oper. Res. 28(4): 847-858 (1980) - [j13]Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey:
A Canonical Representation of Simple Plant Location Problems and Its Applications. SIAM J. Algebraic Discret. Methods 1(3): 261-272 (1980)
1970 – 1979
- 1979
- [j12]Marshall L. Fisher, George L. Nemhauser, Laurence A. Wolsey:
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit. Oper. Res. 27(4): 799-809 (1979) - 1978
- [j11]George L. Nemhauser, Laurence A. Wolsey:
Best Algorithms for Approximating the Maximum of a Submodular Set Function. Math. Oper. Res. 3(3): 177-188 (1978) - [j10]George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher:
An analysis of approximations for maximizing submodular set functions - I. Math. Program. 14(1): 265-294 (1978) - 1977
- [j9]Laurence A. Wolsey:
Cubical Sperner Lemmas as Applications of Generalized Complementary Pivoting. J. Comb. Theory A 23(1): 78-87 (1977) - [j8]Laurence A. Wolsey:
Valid Inequalities and Superadditivity for 0-1 Integer Programs. Math. Oper. Res. 2(1): 66-77 (1977) - 1976
- [j7]Laurence A. Wolsey:
Technical Note - Facets and Strong Valid Inequalities for Integer Programs. Oper. Res. 24(2): 367-372 (1976) - [j6]Laurence A. Wolsey:
Further facet generating procedures for vertex packing polytopes. Math. Program. 11(1): 158-163 (1976) - 1975
- [j5]Laurence A. Wolsey:
Faces for a linear inequality in 0-1 variables. Math. Program. 8(1): 165-178 (1975) - 1974
- [j4]Laurence A. Wolsey:
A number theoretic reformulation and decomposition method for integer programming. Discret. Math. 7(3-4): 393-403 (1974) - [j3]Gordon H. Bradley, Peter L. Hammer, Laurence A. Wolsey:
Coefficient reduction for inequalities in 0-1 variables. Math. Program. 7(1): 263-282 (1974) - 1973
- [j2]Laurence A. Wolsey:
Generalized dynamic programming methods in integer programming. Math. Program. 4(1): 222-232 (1973) - 1971
- [j1]Laurence A. Wolsey:
Group-Theoretic Results in Mixed Integer Programming. Oper. Res. 19(7): 1691-1697 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: