General network design: a unified view of combined location and network design problems (Q1926688): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2011.11.009 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.11.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015646948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398375 / 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: The Capacitated <i>m</i>-Ring-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-cost transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Based Local Search for the Connected Facility Location and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and cutting for multiple allocation hub location problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / 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: Upgrading arcs to minimize the maximum travel time in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the partitioning-hub location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design for time‐constrained delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax flow tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3394446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416579 / 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: Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic uncapacitated hub location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation for the capacitated hub location problem with single assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds from a path based formulation for the tree of hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean bounds for the optimum communication spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated model for logistics network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated single-allocation hub location problem revisited: a note on a classical formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The median tour and maximal covering tour problems: Formulations and heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579459 / 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: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution algorithms for the capacitated single allocation hub location problem / 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: The Covering Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders Decomposition for Hub Location Problems Arising in Public Transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP models for connected facility location: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated concentrator location problem: a reformulation by discretization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning a virtual private network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating path- or tree-shaped facilities on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting polyhedral properties from facility to hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Communication Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5838558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating median cycles in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for hub location problems with single assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral analysis for concentrator location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the hub location problem in a star–star network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a cycle in a transportation or a telecommunications network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hub location problem in designing digital data service networks: Lagrangian relaxation approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics and cooperative approaches for the bi-objective ring star problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating and solving splittable capacitated multiple allocation hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New formulations for the uncapacitated multiple allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension to rapid transit network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated facility location/network design problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location and supply chain management. A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of extensive facility location in networks / 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: Variable neighborhood tabu search and its application to the median cycle problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-routing: issues, models and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating tree-shaped facilities using the ordered median objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Problems Combining Facility Location and Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient heuristics for Median Cycle Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locational analysis: highlights of growth to maturity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual algorithms for connected facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized <i>P</i>‐forest problem on a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler and better derandomization of an approximation algorithm for single source rent-or-buy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the optimal \(p\)-source communication spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentrator location in telecommunications networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star \(p\)-hub median problem with modular arc capacities / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2011.11.009 / rank
 
Normal rank

Latest revision as of 13:00, 16 December 2024

scientific article
Language Label Description Also known as
English
General network design: a unified view of combined location and network design problems
scientific article

    Statements

    General network design: a unified view of combined location and network design problems (English)
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    network location
    0 references
    network design
    0 references
    network routing
    0 references
    location
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers