Benders decomposition for network design covering problems (Q2669611): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q325371
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bernard Fortz / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: stprbh / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3168487990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-project for mixed 0-1 programming: recent progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration of cutting-plane and column generation algorithms: Applications to network design / 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: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transportation systems analysis. Models and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Facet'' separation with one linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition for very large scale partial set covering and maximal covering location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders, metric and cutset inequalities for multicommodity capacitated network design / 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: GRASP algorithms for the robust railway network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact approaches to the single-source network loading problem / 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: Urban rapid transit network design: accelerated Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for a Minimum Cover of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm / 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: Location of speed-up subnetworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank

Latest revision as of 05:40, 28 July 2024

scientific article
Language Label Description Also known as
English
Benders decomposition for network design covering problems
scientific article

    Statements

    Benders decomposition for network design covering problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2022
    0 references
    facility planning and design
    0 references
    Benders decomposition
    0 references
    network design
    0 references
    rapid transit network
    0 references

    Identifiers