Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650759 / rank
 
Normal rank
Property / zbMATH Keywords
 
nonbifurcated hop-constrained multicommodity network design problem
Property / zbMATH Keywords: nonbifurcated hop-constrained multicommodity network design problem / rank
 
Normal rank
Property / zbMATH Keywords
 
formulations
Property / zbMATH Keywords: formulations / rank
 
Normal rank
Property / zbMATH Keywords
 
relaxations
Property / zbMATH Keywords: relaxations / rank
 
Normal rank
Property / zbMATH Keywords
 
Lagrangean relaxation
Property / zbMATH Keywords: Lagrangean relaxation / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2014.07.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002184897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Hop-Constrained Model to Generate Alternative Communication Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints / 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: Notes on polyhedra associated with hop-constrained paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the directed hop-constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Through Virtual Paths in Layered Telecommunication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 reformulations of the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backbone Network Design Tools with Economic Tradeoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flow models for spanning trees with hop constraints / 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: Hop-constrained node survivable network design: An application to MPLS over WDM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simple plant location problem: Survey and synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem with hop constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:50, 12 July 2024

scientific article
Language Label Description Also known as
English
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
scientific article

    Statements

    Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    nonbifurcated hop-constrained multicommodity network design problem
    0 references
    formulations
    0 references
    relaxations
    0 references
    Lagrangean relaxation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references