Branch-and-price-and-cut for a service network design and hub location problem (Q1752143): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Service network design with management and coordination of multiple fleets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest chain subject to side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On splittable and unsplittable flow capacitated network design arc-set polyhedra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub location for time definite transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: General network design: a unified view of combined location and network design problems / 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: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub location-allocation in intermodal logistic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex hull of two core capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multimodal freight transportation planning: a literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Service network design for freight transportation: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price / rank
 
Normal rank

Revision as of 16:10, 15 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-price-and-cut for a service network design and hub location problem
scientific article

    Statements

    Branch-and-price-and-cut for a service network design and hub location problem (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    service network design
    0 references
    hub location
    0 references
    intermodal transport
    0 references
    branch-and-price-and-cut
    0 references
    0 references

    Identifiers

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