300 results on '"Laurence A. Wolsey"'
Search Results
2. Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing.
3. A study of lattice reformulations for integer programming.
4. Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries.
5. Lattice Reformulation Cuts.
6. Convex hull results for generalizations of the constant capacity single node flow set.
7. Integer Programming
8. The item dependent stockingcost constraint.
9. 'Facet' separation with one linear program.
10. The Weighted Arborescence Constraint.
11. Convex hull results for the warehouse problem.
12. Single-Period Cutting Planes for Inventory Routing Problems.
13. Optimum turn-restricted paths, nested compatibility, and optimum convex polygons.
14. Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds.
15. Tight MIP formulations for bounded up/down times and interval-dependent start-ups.
16. Modeling Poset Convex Subsets.
17. Continuous knapsack sets with divisible capacities.
18. The continuous knapsack set.
19. An efficient technique for solving the scheduling of appliances in smart-homes.
20. The StockingCost Constraint.
21. On the Balanced Minimum Evolution polytope.
22. Sufficiency of cut-generating functions.
23. Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances.
24. Experiments with Two Row Tableau Cuts.
25. Relaxations for two-level multi-item lot-sizing problems.
26. On the Practical Strength of Two-Row Tableau Cuts.
27. Covering Linear Programming with Violations.
28. Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles.
29. The Mixing Set with Divisible Capacities.
30. The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows.
31. Inequalities from Two Rows of a Simplex Tableau.
32. A maritime inventory routing problem: Discrete time formulations and valid inequalities.
33. A rendezvous point selection algorithm for videoconferencing applications.
34. Lattice Reformulation Cuts
35. Integer and Combinatorial Optimization
36. On discrete lot-sizing and scheduling on identical parallel machines.
37. MIP formulations and heuristics for two-level production-transportation problems.
38. Mixing Sets Linked by Bidirected Paths.
39. Constrained Infinite Group Relaxations of MIPs.
40. Composite lifting of group inequalities and an application to two-row mixing inequalities.
41. Optimizing production and transportation in a commit-to-delivery business mode.
42. Lattice based extended formulations for integer linear equality systems.
43. Traces of the XII Aussois Workshop on Combinatorial Optimization.
44. Single item lot-sizing with non-decreasing capacities.
45. Two row mixed-integer cuts via lifting.
46. Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs.
47. Uncapacitated two-level lot-sizing.
48. Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times.
49. Lot-Sizing with Stock Upper Bounds and Fixed Charges.
50. Multi-item lot-sizing with joint set-up costs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.