Algorithms for the non-bifurcated network design problem (Q2271128): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Aristide Mingozzi / rank
Normal rank
 
Property / author
 
Property / author: Aristide Mingozzi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / 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.1007/s10732-008-9091-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071407655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Capacitated Multicommodity Networks with Multiple Facilities / 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: On the \(k\)-cut problem / 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: A Simplex-Based Tabu Search Method for Capacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Procedure for Leasing Channels in Telecommunications Networks / 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: Networks synthesis and optimum network design problems: Models, solution methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results for the edge capacity polytope. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirected and unidirected capacity installation in telecommunication networks. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:20, 1 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for the non-bifurcated network design problem
scientific article

    Statements

    Algorithms for the non-bifurcated network design problem (English)
    0 references
    0 references
    0 references
    6 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    network design
    0 references
    integer programming
    0 references
    heuristic algorithms
    0 references
    partial enumeration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references