A set covering based matheuristic for a real‐world city logistics problem (Q5246831): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition, Lagrangean relaxation and metaheuristic design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the simplified multiple depot crew scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent procedure for the set partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the set covering problem / 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: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set Partitioning Approach to the Crew Scheduling Problem / 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 Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) / rank
 
Normal rank

Revision as of 00:23, 10 July 2024

scientific article; zbMATH DE number 6428815
Language Label Description Also known as
English
A set covering based matheuristic for a real‐world city logistics problem
scientific article; zbMATH DE number 6428815

    Statements

    A set covering based matheuristic for a real‐world city logistics problem (English)
    0 references
    22 April 2015
    0 references
    matheuristics
    0 references
    set covering problem
    0 references
    dual ascent
    0 references
    Lagrangian relaxation
    0 references
    city logistics
    0 references
    0 references
    0 references

    Identifiers

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