Planning models for long-haul operations of postal and express shipment companies (Q1582188): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Air Network Design for Express Shipment Service / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for solving large capacitated warehouse location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of heuristics and relaxations for the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Service network design in freight transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning models for freight transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part I: The Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part II: The Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgradient Methods for the Service Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398373 / 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: Optimal Routing under Capacity and Distance Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drive: Dynamic Routing of Independent Vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pickup and Delivery of Partial Loads with “Soft” Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395424 / rank
 
Normal rank

Latest revision as of 16:10, 30 May 2024

scientific article
Language Label Description Also known as
English
Planning models for long-haul operations of postal and express shipment companies
scientific article

    Statements

    Planning models for long-haul operations of postal and express shipment companies (English)
    0 references
    0 references
    0 references
    3 October 2000
    0 references
    0 references
    modeling
    0 references
    transportation
    0 references
    network design
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references