Laurence Wolsey

Q: What Schools Are Affiliated With Laurence Wolsey

Laurence Wolsey is affiliated with the following schools: Université catholique de Louvain, University of Oxford, Massachusetts Institute of Technology, Cornell University

Laurence Wolsey's AcademicInfluence.com Rankings

Laurence Wolsey

Mathematics

#1449

World Rank

#2376

Historical Rank

Measure Theory

#390

World Rank

#570

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Laurence Wolsey Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Laurence Alexander Wolsey is an English mathematician working in the field of integer programming. He is a former president and research director of the Center for Operations Research and Econometrics at Université catholique de Louvain in Belgium. He is professor emeritus of applied mathematics at the engineering school of the same university.

(See a Problem?)

Laurence Wolsey's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Integer and Combinatorial Optimization (1988) (5263)
Integer Programming (2020) (4511)
An analysis of approximations for maximizing submodular set functions—I (1978) (4372)
Production Planning by Mixed Integer Programming (2010) (926)
Best Algorithms for Approximating the Maximum of a Submodular Set Function (1978) (564)
An analysis of the greedy algorithm for the submodular set covering problem (1982) (512)
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 (2007) (502)
Faces for a linear inequality in 0–1 variables (1975) (329)
Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering) (2006) (298)
Solving Mixed Integer Programming Problems Using Automatic Reformulation (1987) (277)
Strong Formulations for Multi-Item Capacitated Lot Sizing (1984) (276)
Valid Linear Inequalities for Fixed Charge Problems (1985) (262)
Formulating the single machine sequencing problem with release dates as a mixed integer program (1990) (258)
An exact algorithm for IP column generation (1994) (253)
Cutting planes in integer and mixed integer programming (2002) (253)
A time indexed formulation of non-preemptive single machine scheduling problems (1992) (242)
A recursive procedure to generate all cuts for 0–1 mixed integer programs (1990) (227)
Aggregation and Mixed Integer Rounding to Solve MIPs (2001) (222)
Uncapacitated lot-sizing: The convex hull of solutions (1984) (216)
Heuristic analysis, linear programming and branch and bound (1980) (213)
Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs (2001) (197)
Reformulation and Decomposition of Integer Programs (2009) (196)
bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems (2000) (191)
Wiley‐Interscience Series in Discrete Mathematics and Optimization (2014) (178)
Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation (2002) (162)
Lot-Sizing with Constant Batches: Formulation and Valid Inequalities (1993) (160)
Lot-size models with backlogging: Strong reformulations and cutting planes (1988) (157)
Multi-item lot-sizing problems using strong cutting planes (1991) (154)
Integer programming duality: Price functions and sensitivity analysis (1981) (153)
Polyhedra for lot-sizing with Wagner—Whitin costs (1994) (150)
Valid inequalities for mixed 0-1 programs (1986) (149)
A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem (2003) (148)
Inequalities from Two Rows of a Simplex Tableau (2007) (146)
Mixed Integer Programming (2008) (141)
The 0-1 Knapsack problem with a single continuous variable (1999) (141)
Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems (1982) (135)
Technical Note - Facets and Strong Valid Inequalities for Integer Programs (1976) (134)
Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms* (1981) (130)
Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints (1990) (122)
The node capacitated graph partitioning problem: A computational study (1998) (122)
Two row mixed-integer cuts via lifting (2010) (109)
Valid Inequalities and Superadditivity for 0-1 Integer Programs (1977) (106)
MIP modelling of changeovers in production planning and scheduling problems (1997) (102)
Capacitated Facility Location: Valid Inequalities and Facets (1995) (101)
Formulations and valid inequalities for the node capacitated graph partitioning problem (1996) (96)
Constrained Infinite Group Relaxations of MIPs (2010) (92)
Tight formulations for some simple mixed integer programs and convex objective integer programs (2003) (91)
Two “well-known” properties of subgradient optimization (2009) (90)
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit (1979) (88)
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (1993) (86)
bc–opt: a branch-and-cut code for mixed integer programs (1999) (86)
A maritime inventory routing problem: Discrete time formulations and valid inequalities (2013) (80)
Chapter 9 Optimal trees (1995) (78)
Cutting planes for integer programs with general integer variables (1998) (78)
Progress With Single-item Lot-sizing (1995) (77)
Approximate extended formulations (2006) (76)
An elementary survey of general duality theory in mathematical programming (1981) (75)
Non-standard approaches to integer programming (2002) (75)
Lot-sizing with production and delivery time windows (2005) (73)
Covering Linear Programming with Violations (2014) (73)
Trees and Cuts (1983) (70)
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles (2008) (70)
The uncapacitated lot-sizing problem with sales and safety stocks (2001) (69)
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms (1998) (67)
Cutting Planes form Two Rows of a Simplex Tableau (2007) (65)
Packing and covering a tree by subtrees (1986) (65)
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (2003) (64)
Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates (2006) (64)
Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation (1995) (58)
Coefficient reduction for inequalities in 0–1 variables (1974) (58)
Valid inequalities and separation for uncapacitated fixed charge networks (1985) (56)
Uncapacitated Lot-Sizing Problems with Start-Up Costs (1989) (55)
Further facet generating procedures for vertex packing polytopes (1976) (53)
A Canonical Representation of Simple Plant Location Problems and Its Applications (1980) (53)
On the greedy heuristic for continuous covering and packing problems (1982) (52)
Economic Decision Making : Games, Econometrics and Optimisation : Contributions in Honour of Jacques H. Drèze (1992) (52)
Algorithms and reformulations for lot sizing problems (1994) (52)
Sensitivity Analysis for Branch and Bound Integer Programming (1985) (51)
Scheduling projects with labor constraints (2001) (51)
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem (1980) (51)
Designing Private Line Networks - Polyhedral Analysis and Computation (1996) (50)
Uncapacitated two-level lot-sizing (2010) (49)
Strong formulations for mixed integer programming: A survey (1989) (49)
Submodularity and valid inequalities in capacitated fixed charge networks (1989) (48)
Strong formulations for mixed integer programs: valid inequalities and extended formulations (2003) (46)
Network Formulations of Mixed-Integer Programs (2006) (44)
Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems (2003) (44)
The b-hull of an integer program (1981) (44)
Mixing Sets Linked by Bidirected Paths (2011) (40)
MIP formulations and heuristics for two-level production-transportation problems (2012) (37)
Decomposition of Integer Programs and of Generating Sets (1997) (37)
Single-Period Cutting Planes for Inventory Routing Problems (2017) (36)
Compact formulations as a union of polyhedra (2005) (35)
Relaxations for two-level multi-item lot-sizing problems (2014) (35)
Dynamic knapsack sets and capacitated lot-sizing (2003) (34)
Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances (2015) (34)
Experiments with Two Row Tableau Cuts (2010) (34)
The Uncapicitated Facility Location Problem (1983) (33)
Sufficiency of cut-generating functions (2015) (31)
Lot-Sizing on a Tree (2006) (31)
Extensions of the Group Theoretic Approach in Integer Programming (1971) (31)
Multi-item lot-sizing with joint set-up costs (2009) (30)
Lot-sizing problems: modelling issues and a specialized branch-and-cut system BC - PROD (1998) (30)
Time Indexed Formulations Of Non-Preemptive Single-Machine Schduling Problems (1989) (28)
A resource decomposition algorithm for general mathematical programs (1981) (27)
“Facet” separation with one linear program (2019) (27)
Single item lot-sizing with non-decreasing capacities (2007) (27)
Optimizing production and transportation in a commit-to-delivery business mode (2010) (26)
On unions and dominants of polytopes (2004) (25)
Tight MIP formulations for bounded up/down times and interval-dependent start-ups (2017) (25)
A new approach to minimising the frontwidth in finite element calculations (1994) (24)
On the Practical Strength of Two-Row Tableau Cuts (2014) (23)
Fractional covers for forests and matchings (1984) (22)
Composite lifting of group inequalities and an application to two-row mixing inequalities (2010) (22)
Continuous knapsack sets with divisible capacities (2016) (22)
Generalized dynamic programming methods in integer programming (1973) (22)
Lot-Sizing with Stock Upper Bounds and Fixed Charges (2010) (21)
Chapter VI Integer programming (1989) (21)
Valid inequalities, covering problems and discrete dynamic programs (1977) (21)
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs (1994) (20)
The Mixing Set with Flows (2005) (20)
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (2010) (20)
Optimizing constrained subtrees of trees (1995) (19)
Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations (1993) (19)
Formulating Single Machine Scheduling Problems With Precedence Constraints (1989) (19)
The continuous knapsack set (2016) (18)
Modelling piecewise linear concave costs in a tree partitioning problem (1994) (18)
Finding minimum cost directed trees with demands and capacities (1991) (17)
Group-Theoretic Results in Mixed Integer Programming (1971) (17)
The nucleolus and kernel for simple games or special valid inequalities for 0–1 linear integer programs (1976) (17)
The Scope of Integer and Combinatorial Optimization (2014) (17)
Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs (2002) (17)
Optimal placement of add /drop multiplexers static and dynamic models (1998) (17)
Solving mixed integer programs y automatic reformulation (1984) (16)
The Mixing Set with Divisible Capacities (2008) (16)
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs (2010) (15)
Lifting group inequalities and an application to mixing inequalities (2009) (13)
Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems (1992) (13)
On discrete lot-sizing and scheduling on identical parallel machines (2012) (13)
On the cut polyhedron (2004) (12)
Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries (2021) (11)
Cubical Sperner Lemmas as Applications of Generalized Complementary Pivoting (1977) (11)
Valid Inequalities for the Lasdon-Terjung Production Model (1992) (11)
Lattice based extended formulations for integer linear equality systems (2007) (10)
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (2007) (9)
Economic lot-sizing with start-up costs: the convex hull. (1991) (8)
The StockingCost Constraint (2014) (8)
Lifting integer variables in minimal inequalities corresponding (2008) (8)
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows (2007) (8)
An efficient technique for solving the scheduling of appliances in smart-homes (2014) (8)
Cutting planes from two rows of the simplex tableau (extended version) (2006) (7)
Lot-sizing polyhedra with a cardinality constraint (1992) (7)
Extended formulations for Gomory Corner polyhedra (2004) (7)
Integer Programming and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem With Deadlines and Release Dates (2003) (6)
On the Wagner-Whitin Lot-Sizing Polyhedron (2001) (6)
Convex hull results for the warehouse problem (2018) (6)
Global Constraint for the Set Covering Problem (2007) (6)
A rendezvous point selection algorithm for videoconferencing applications (2002) (6)
Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds (2017) (5)
A recursive procedure for generating all mixed integer cuts (1984) (5)
Cutting Plane Algorithms for Integer Programming, Cutting Plane Algorithms (1998) (5)
On the Balanced Minimum Evolution polytope (2020) (5)
Modeling Poset Convex Subsets (2015) (4)
Relaxation Methods for Pure and Mixed Integer Programming Problems (2015) (4)
Capacitated facility location : valid inequalities and facets (Erratum) (1996) (4)
Uncapacitated lot-sizing with buying, sales and backlogging (2004) (4)
Mixed integer programming for production planning and scheduling (2008) (4)
Ls-Lib: A Library of Reformulations, Cut Separation Algorithms and Primal Heuristics in a High-Level Modeling Language for Solving MIP Production Planning Problems (2005) (3)
A view of shortest route methods in integer programming (1974) (3)
Traces of the XII Aussois Workshop on Combinatorial Optimization (2010) (3)
Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings (2008) (3)
A number theoretic reformulation and decomposition method for integer programming (1974) (2)
Multi-Item Lot-Sizing with a Joint Set-Up Cost (2005) (2)
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons (2018) (2)
The item dependent stockingcost constraint (2019) (2)
The Mathematical Programming Society (1977) (2)
The Weighted Arborescence Constraint (2017) (2)
Discrete lot-sizing and convex integer programming (2001) (2)
Matroid and Submodular Function Optimization (2014) (2)
Tight MIP formulations for bounded up/down times and interval-dependent start-ups (2016) (2)
Designing private line networks (2004) (2)
Polynomial‐Time Algorithms for Linear Programming (2014) (2)
The Aussois 2000 workshop in combinatorial optimization (2003) (2)
Applications of Special‐Purpose Algorithms (2014) (2)
Sufficiency of cut-generating functions (2014) (1)
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993 (1993) (1)
Groups, bounds and cuts for integer programming problems (1973) (1)
Strong Valid Inequalities and Facets for Structured Integer Programs (2014) (1)
Convex hull results for generalizations of the constant capacity single node flow set (2020) (1)
Uncapacitated Lot-Sizing with Stock Upper Bounds, Stock Fixed Costs, Stock Overloads and Backlogging: A Tight Formulation (2015) (1)
On the use of penumbras in blocking and antiblocking theory (1982) (1)
The Theory of Valid Inequalities (2014) (1)
Groups, bounds and cuts in integer programming (1973) (0)
Continuous knapsack sets with divisible capacities (2015) (0)
Lattice Reformulation Cuts (2021) (0)
2 The Mixed Integer Rounding and Gomory Mixed Integer Inequalities (1998) (0)
Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds (2016) (0)
LISCOS Growth Project: Manual of modelling conventions with examples (2000) (0)
“Facet” separation with one linear program (2018) (0)
Combinatorial Optimization : Theory and Computation (2005) (0)
Optimal trees. In M. O. Ball et al (eds.) (1995) (0)
Book review (1992) (0)
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004 (2006) (0)
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons (2018) (0)
Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007) (0)
2 Valid Inequalities for Dynamic Knapsack Sets (2000) (0)
Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges (2011) (0)
Discrete Lot-Sizing and Scheduling on Identical Parallel Machines C . (2019) (0)
Duality and Relaxation (2014) (0)
Strong and compact relaxations in the original space using a compact extended formulation (2013) (0)
Integral polyhedra with a cardinality constraint (1990) (0)
Relaxations for two-level multi-item lot-sizing problems (2013) (0)
The Aussois 2000 workshop in combinatorial optimization introduction (2003) (0)
LATTICE REFORMULATIONS CUTS (2018) (0)
Convex hull results for generalizations of the constant capacity single node flow set (2020) (0)
Facets and Strong Valid Inequalities for (2016) (0)
Dis rete Lot { Sizing and Convex IntegerProgrammingAndrew (2001) (0)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics: Preface (2005) (0)
Constraint Programming and Integer Programming (Dagstuhl Seminar 00031) (2021) (0)
Production , Manufacturing and Logistics Optimizing production and transportation in a commit-to-delivery business mode q (2009) (0)
Special‐Purpose Algorithms (2014) (0)
Simple MIPs and Lot-Sizing : New Results and Recent Favourites (2010) (0)
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : Proceedings of CPAIOR 2007 (2009) (0)
The item dependent stockingcost constraint (2019) (0)
LISCOS Growth Project: Initial report on generic supply chain models (2000) (0)
The continuous knapsack set (2015) (0)
Benders’ algorithm with (mixed)-integer subproblems (2019) (0)
Time for Old and New Faces (2004) (0)
Using extended MIP formulations for a production/sequencing and a production/distribution problem (2011) (0)
8. Conclusions 8.1 Conclusions Relating to the Integer Programming Heuristics 8.2 Conclusions Relating to the Engineering Impact of Network Design Alternatives (2007) (0)
Graphs and Networks (2014) (0)
Extended Formulations of Integer Programs: Theory and Practice (2012) (0)
Benders-type Branch-and-Cut Algorithms for Capacitated Facility Location with Single-Sourcing (2023) (0)

This paper list is powered by the following services:

Other Resources About Laurence Wolsey

en.wikipedia.org

What Schools Are Affiliated With Laurence Wolsey?

Laurence Wolsey is affiliated with the following schools:

Laurence Wolsey's Academic­Influence.com Rankings