Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760): 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: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation and an exact approach for the many-to-many hub location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Arc Location Problems: Part I—Introduction and Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Large-Scale Uncapacitated Hub Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic uncapacitated hub location / 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: The tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Assignment of Locomotives and Cars to Passenger Trains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Benders decomposition applied to fixed-charge network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally unimodular Leontief directed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the selection of Benders' cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Benders decomposition applied to a multi-layer network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub-and-spoke network design and fleet deployment for string planning of liner shipping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tailoring Benders decomposition for uncapacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Benders' Partitioning Algorithm for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic integer program for the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub network design with single and multiple allocation: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical enhancements to the Magnanti-Wong method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated airline scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leontief Substitution Systems and Matroid Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Benders decomposition algorithm: a literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Benders decomposition algorithm for the tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme points of Leontief substitution systems / rank
 
Normal rank

Latest revision as of 17:38, 21 July 2024

scientific article
Language Label Description Also known as
English
Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
scientific article

    Statements

    Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (English)
    0 references
    0 references
    0 references
    0 references
    12 February 2020
    0 references
    hub location problems
    0 references
    hub and spoke networks
    0 references
    Leontief flow substitution systems
    0 references
    Benders decomposition method
    0 references
    improved benders feasibility cuts
    0 references
    0 references
    0 references

    Identifiers