Polyhedral structure of the 4-node network design problem (Q3057114): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1002/net.20317 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4254784363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Partition-based facets of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric inequalities and the network loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Telecommunication link restoration planning with multiple facility types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost capacity installation for multicommodity network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong inequalities for capacitated survivable network design problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to multicommodity survivable network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial approaches to multiflow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths, single origin‐destination network design, and associated polyhedra / 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: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for network design problems with connectivity requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A directed cycle-based column-and-cut generation method for capacitated survivable network design / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:57, 3 July 2024

scientific article
Language Label Description Also known as
English
Polyhedral structure of the 4-node network design problem
scientific article

    Statements

    Polyhedral structure of the 4-node network design problem (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    facet inequality
    0 references
    multicommodity
    0 references
    network design
    0 references
    integer programming
    0 references
    polyhedral structure
    0 references
    \(k\)-partition
    0 references
    0 references