Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4221472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating capacity constraints in the CVRP using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical optimization. Theoretical and practice aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal rectangular partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral study of the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relaxation approach to the edge-weighted clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing problems: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of the Petal Method for Vehicle Routeing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank

Latest revision as of 18:24, 6 June 2024

scientific article
Language Label Description Also known as
English
Stronger \(K\)-tree relaxations for the vehicle routing problem
scientific article

    Statements

    Stronger \(K\)-tree relaxations for the vehicle routing problem (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    Integer programming
    0 references
    Exact solution algorithm
    0 references
    Vehicle routing problem
    0 references
    Relax
    0 references
    and cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers