On the capacitated concentrator location problem: a reformulation by discretization
From MaRDI portal
Publication:2496022
DOI10.1016/j.cor.2004.09.013zbMath1126.90377OpenAlexW1987110435MaRDI QIDQ2496022
Francisco Saldanha-Da-gama, Luís Gouveia
Publication date: 30 June 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.09.013
Related Items
Exactly solving a two-level location problem with modular node capacities, Single PON network design with unconstrained splitting stages, The mixed capacitated general routing problem under uncertainty, Two-phase branch-and-cut for the mixed capacitated general routing problem, Solving a dynamic facility location problem with partial closing and reopening, Discretized formulations for capacitated location problems with modular distribution costs, General network design: a unified view of combined location and network design problems, Extended formulation for hop constrained distribution network configuration problems, Enhancing discretized formulations: the knapsack reformulation and the star reformulation, A Survey of the Generalized Assignment Problem and Its Applications, Locating Satellite Yards in Forestry Operations, Lower and upper bounds for a two-level hierarchical location problem in computer networks, Solving the variable size bin packing problem with discretized formulations, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, Reformulation by discretization: application to economic lot sizing, Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs, Solving the maximum edge-weight clique problem in sparse graphs with compact formulations, Unnamed Item, Prize collecting Steiner trees with node degree dependent costs, A new extended formulation with valid inequalities for the capacitated concentrator location problem, Modeling and solving a logging camp location problem
Cites Work
- Unnamed Item
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- Efficient algorithms for the capacitated concentrator location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- A Lagrangean heuristic for the facility location problem with staircase costs
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- A classification of formulations for the (time-dependent) traveling salesman problem
- The capacitated plant location problem
- Upper and lower bounds for the single source capacitated location problem.
- A Lagrangean heuristic for a modular capacitated location problem
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- A multiplier adjustment technique for the capacitated concentrator location problem
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- On solving complex multi-period location models using simulated annealing.
