The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Laurence A. Wolsey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey
    Decomposition of Integer Programs and of Generating Sets. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:92-102 [Conf]
  2. Yves Pochet, Laurence A. Wolsey
    Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:150-164 [Conf]
  3. Denis Vanderstraeten, O. Zone, R. Keunings, Laurence A. Wolsey
    Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations. [Citation Graph (0, 0)][DBLP]
    PPSC, 1993, pp:929-932 [Conf]
  4. Quentin Louveaux, Laurence A. Wolsey
    Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. [Citation Graph (0, 0)][DBLP]
    4OR, 2003, v:1, n:3, pp:173-207 [Journal]
  5. Imre Bárány, Jack Edmonds, Laurence A. Wolsey
    Packing and covering a tree by subtrees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:3, pp:221-233 [Journal]
  6. Laurence A. Wolsey
    An analysis of the greedy algorithm for the submodular set covering problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:4, pp:385-393 [Journal]
  7. Karen Aardal, Robert Weismantel, Laurence A. Wolsey
    Non-standard approaches to integer programming. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:5-74 [Journal]
  8. El Houssaine Aghezzaf, Laurence A. Wolsey
    Modelling piecewise linear concave costs in a tree partitioning problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:2, pp:101-109 [Journal]
  9. Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey
    Scheduling projects with labor constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:27-52 [Journal]
  10. Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence A. Wolsey
    Cutting planes in integer and mixed integer programming. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:397-446 [Journal]
  11. Yves Pochet, Laurence A. Wolsey
    Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:1, pp:57-74 [Journal]
  12. Michele Conforti, Giovanni Rinaldi, Laurence A. Wolsey
    On the cut polyhedron. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:277, n:1-3, pp:279-285 [Journal]
  13. Laurence A. Wolsey
    Cubical Sperner Lemmas as Applications of Generalized Complementary Pivoting. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:23, n:1, pp:78-87 [Journal]
  14. Quentin Louveaux, Laurence A. Wolsey
    Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:3, pp:470-484 [Journal]
  15. Olivier Pereira, Laurence A. Wolsey
    On the Wagner-Whitin Lot-Sizing Polyhedron. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2001, v:26, n:3, pp:591-600 [Journal]
  16. El Houssaine Aghezzaf, Thomas L. Magnanti, Laurence A. Wolsey
    Optimizing constrained subtrees of trees. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:113-126 [Journal]
  17. Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey
    On unions and dominants of polytopes. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:99, n:2, pp:223-239 [Journal]
  18. Sebastián Ceria, Cécile Cordier, Hugues Marchand, Laurence A. Wolsey
    Cutting planes for integer programs with general integer variables. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:81, n:, pp:201-214 [Journal]
  19. C. E. Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey
    Formulations and valid inequalities for the node capacitated graph partitioning problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:74, n:, pp:247-266 [Journal]
  20. C. E. Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey
    The node capacitated graph partitioning problem: A computational study. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:81, n:, pp:229-256 [Journal]
  21. Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
    Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:157-160 [Journal]
  22. Marko Loparic, Hugues Marchand, Laurence A. Wolsey
    Dynamic knapsack sets and capacitated lot-sizing. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2003, v:95, n:1, pp:53-69 [Journal]
  23. George L. Nemhauser, Laurence A. Wolsey
    A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:379-390 [Journal]
  24. Yves Pochet, Laurence A. Wolsey
    Polyhedra for lot-sizing with Wagner-Whitin costs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:67, n:, pp:297-323 [Journal]
  25. Jorge P. Sousa, Laurence A. Wolsey
    A time indexed formulation of non-preemptive single machine scheduling problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:353-367 [Journal]
  26. Mathieu Van Vyve, Laurence A. Wolsey
    Approximate extended formulations. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:501-522 [Journal]
  27. Laurence A. Wolsey
    Lot-sizing with production and delivery time windows. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:107, n:3, pp:471-489 [Journal]
  28. Francisco Ortega, Laurence A. Wolsey
    A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:3, pp:143-158 [Journal]
  29. C. P. M. van Hoesel, Albert P. M. Wagelmans, Laurence A. Wolsey
    Polyhedral Characterization of the Economic Lot-Sizing Problemwith Start-Up Costs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:141-151 [Journal]
  30. Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey
    Inequalities from Two Rows of a Simplex Tableau. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:1-15 [Conf]
  31. Michele Conforti, Marco Di Summa, Laurence A. Wolsey
    The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:352-366 [Conf]

  32. The Mixing Set with Divisible Capacities. [Citation Graph (, )][DBLP]


  33. Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. [Citation Graph (, )][DBLP]


  34. Experiments with Two Row Tableau Cuts. [Citation Graph (, )][DBLP]


  35. Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times. [Citation Graph (, )][DBLP]


  36. Formulating the single machine sequencing problem with release dates as a mixed integer program. [Citation Graph (, )][DBLP]


  37. Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints. [Citation Graph (, )][DBLP]


Search in 0.027secs, Finished in 0.029secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002