Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PORTA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061119272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the fleet size and mix vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the heterogeneous fleet vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for determining fleet size and composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fleet size and mix vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on projection for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of travelling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing problems: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection results for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistars, partial multistars and the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of different formulations of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweep-based algorithm for the fleet size and mix vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating vehicle into the vehicle routing fleet composition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic column generation method for the heterogeneous fleet VRP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search variants for the mix fleet vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Integer Knapsack Cover Polyhedron / rank
 
Normal rank

Latest revision as of 13:41, 24 June 2024

scientific article
Language Label Description Also known as
English
Formulations and valid inequalities for the heterogeneous vehicle routing problem
scientific article

    Statements

    Formulations and valid inequalities for the heterogeneous vehicle routing problem (English)
    0 references
    0 references
    2 May 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Heterogeneous vehicle routing problem
    0 references
    Mix fleet
    0 references
    Valid inequalities
    0 references
    Lifting
    0 references
    projection
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references