A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57719334, #quickstatements; #temporary_batch_1711574657256
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on matheuristics for routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choice of explicit stabilizing terms in column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of bundle and classical column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problem with elementary shortest path based column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integration of an interior-point cutting plane method within a branch-and-price algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Suggested Computation for Maximal Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Bundle Methods / 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 constrained optimization by adjoint based quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point methods 25 years later / rank
 
Normal rank
Property / cites work
 
Property / cites work: New developments in the primal-dual column generation technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale optimization with the primal-dual column generation method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing problems with loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large airline crew scheduling problems: Random pairing generation and strong branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Search Strategies for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the primal-dual interior point algorithm within the branch-price-and-cut method / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved branch-cut-and-price for capacitated vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point stabilization for column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete time window assignment vehicle routing problem / 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: Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Mixed Integer Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354953 / rank
 
Normal rank

Revision as of 06:35, 17 July 2024

scientific article
Language Label Description Also known as
English
A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
scientific article

    Statements

    A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (English)
    0 references
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    vehicle routing
    0 references
    multiple deliverymen
    0 references
    time windows
    0 references
    branch-price-and-cut
    0 references
    interior point
    0 references
    0 references
    0 references

    Identifiers

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