A branch and bound algorithm for the capacitated vehicle routing problem (Q585095): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Gilbert Laporte / rank
Normal rank
 
Property / author
 
Property / author: Yves Nobert / rank
Normal rank
 
Property / author
 
Property / author: Yves Nobert / 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: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / 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: An Integer Programming Approach to the Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Linear Programming in the Oil Industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing vehicle routing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem: Solution of a 120-city problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for minimizing routing and operating costs in depot location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two exact algorithms for the distance-constrained vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming approaches to the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01720015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066878540 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the capacitated vehicle routing problem
scientific article

    Statements

    A branch and bound algorithm for the capacitated vehicle routing problem (English)
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    capacitated vehicle routing
    0 references
    branch and bound procedure
    0 references
    capacity constraints
    0 references
    exact solutions
    0 references

    Identifiers

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