Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Angular-Metric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum reload cost paths, tours, and flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving an urban waste collection problem using ants heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational comparison of flow formulations for the capacitated location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric quadratic traveling salesman problem / 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 Dynamic Programming Heuristic for the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum reload cost cycle cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum reload \(s-t\) path, trail and walk problems / 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: On the symmetric travelling salesman problem I: Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably good solutions for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Routing under Capacity and Distance Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / 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: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic diversification and intensification in local search for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for a class of vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for the heterogeneous fleet vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit depot assignments and rotations in vehicle routing heuristics / rank
 
Normal rank

Latest revision as of 20:22, 11 July 2024

scientific article
Language Label Description Also known as
English
Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure
scientific article

    Statements

    Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (English)
    0 references
    0 references
    0 references
    25 April 2016
    0 references
    quadratic capacitated vehicle routing problem
    0 references
    angle capacitated vehicle routing problem
    0 references
    capacitated vehicle routing problem with reload costs
    0 references
    branch and cut
    0 references
    hybrid metaheuristic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references