Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Math Program Ser A

Search In Journal Title:

Abbravation: Mathematical Programming

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1002/clc.4960130813

Search In DOI:

ISSN

1436-4646

Search In ISSN:
Search In Title Of Papers:

A new branchandcut algorithm for the capacitated

Authors: Jens Lysgaard Adam N Letchford Richard W Eglese
Publish Date: 2003/11/21
Volume: 100, Issue: 2, Pages: 423-445
PDF Link

Abstract

We present a new branchandcut algorithm for the capacitated vehicle routing problem CVRP The algorithm uses a variety of cutting planes including capacity framed capacity generalized capacity strengthened comb multistar partial multistar extended hypotour inequalities and classical Gomory mixedinteger cutsFor each of these classes of inequalities we describe our separation algorithms in detail Also we describe the other important ingredients of our branchandcut algorithm such as the branching rules the node selection strategy and the cut pool management Computational results for a large number of instances show that the new algorithm is competitive In particular we solve three instances Bn50k8 Bn66k9 and Bn78k10 of Augerat to optimality for the first time

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Submodular maximization meets streaming: matchings, matroids, and more
  2. Some computationally relevant group theoretic structures of fixed charge problems
  3. Applications of convex analysis within mathematics
  4. Large-scale semidefinite programs in electronic structure calculation
  5. A distributionally robust perspective on uncertainty quantification and chance constrained programming
  6. The factorization approach to large-scale linear programming
  7. Beyond symmetric Broyden for updating quadratic models in minimization without derivatives
  8. A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
  9. Breakpoint searching algorithms for the continuous quadratic knapsack problem
  10. Sandwich games
  11. Approximations of Nash equilibria
  12. Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
  13. A robust and efficient method for solving point distance problems by homotopy
  14. A nonmonotone GRASP
  15. Extreme point inequalities and geometry of the rank sparsity ball
  16. Primal-dual interior-point methods for PDE-constrained optimization
  17. Single item lot-sizing with non-decreasing capacities
  18. Structural and algorithmic properties for parametric minimum cuts
  19. Simple integer recourse models: convexity and convex approximations
  20. A model of the coNP-complete non-Hamilton tour decision problem for directed graphs
  21. Iteration complexity analysis of block coordinate descent methods
  22. Error Bounds of Regularized Gap Functions for Nonsmooth Variational Inequality Problems
  23. Accelerating the cubic regularization of Newton’s method on convex problems
  24. Bundle methods for sum-functions with “easy” components: applications to multicommodity network design
  25. On the number of solutions to the linear comple-mentarity problem
  26. Time-consistent approximations of risk-averse multistage stochastic optimization problems
  27. PEBBL: an object-oriented framework for scalable parallel branch and bound
  28. PEBBL: an object-oriented framework for scalable parallel branch and bound
  29. The capacitated max k -cut problem
  30. Critical extreme points of the 2-edge connected spanning subgraph polytope
  31. Nash equilibria in the two-player kidney exchange game
  32. On some properties and an application of the logarithmic barrier method
  33. Complementarity systems in optimization
  34. On the exact separation of mixed integer knapsack cuts
  35. Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
Search Result: