Pages that link to "Item:Q3856429"
From MaRDI portal
The following pages link to A Dual-Based Procedure for Uncapacitated Facility Location (Q3856429):
Displayed 50 items.
- The capacitated plant location problem (Q1390274) (← links)
- Neighborhood search heuristics for the uncapacitated facility location problem (Q1400664) (← links)
- Upper and lower bounds for the single source capacitated location problem. (Q1410616) (← links)
- An interactive procedure dedicated to a bicriteria plant location model. (Q1413829) (← links)
- Budget constrained location problem with opening and closing of facilities. (Q1413833) (← links)
- A multiperiod two-echelon multicommodity capacitated plant location problem (Q1569931) (← links)
- Clustering of objects and attributes for manufacturing and marketing applications (Q1572988) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem (Q1607016) (← links)
- A repeated matching heuristic for the single-source capacitated facility location problem (Q1610126) (← links)
- Multi-level facility location problems (Q1754251) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- A branch-and-bound method for multicommodity location with balancing requirements (Q1804068) (← links)
- Lagrangean heuristics for location problems (Q1804069) (← links)
- The plant location problem with demand-dependent setup costs and centralized allocation (Q1806866) (← links)
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type (Q1809805) (← links)
- Exact solution methods for uncapacitated location problems with convex transportation costs (Q1809831) (← links)
- Constraint satisfaction problems: Algorithms and applications (Q1809839) (← links)
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
- An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- Solving covering problems and the uncapacitated plant location problem on trees (Q1838422) (← links)
- A combinatorial approach to level of repair analysis (Q1840842) (← links)
- An optimization approach to plan for reusable software components (Q1847245) (← links)
- Facility location with increasing production costs (Q1869420) (← links)
- Multiobjective solution of the uncapacitated plant location problem (Q1869487) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- A monotonic, dual-based bounding procedure for integer programs (Q1894724) (← links)
- A robustness approach to international sourcing (Q1904678) (← links)
- A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements (Q1928308) (← links)
- A two-phased approach to the supply network reconfiguration problem (Q1971987) (← links)
- Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← links)
- RAMP algorithms for the capacitated facility location problem (Q2240709) (← links)
- A dual RAMP algorithm for single source capacitated facility location problems (Q2240710) (← links)
- A new local search for continuous location problems (Q2255938) (← links)
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem (Q2271817) (← links)
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints (Q2367382) (← links)
- Topological design of a two-level network with ring-star configuration (Q2367422) (← links)
- A novel differential evolution algorithm for binary optimization (Q2376130) (← links)
- Efficient reformulations for dynamic lot-sizing problems with product substitution (Q2379664) (← links)
- Dynamic supply chain design with inventory (Q2384884) (← links)
- BEAMR: an exact and approximate model for the \(p\)-median problem (Q2384887) (← links)
- On solving the discrete location problems when the facilities are prone to failure (Q2477339) (← links)
- Solving the uncapacitated facility location problem using tabu search (Q2489305) (← links)
- A simple filter-and-fan approach to the facility location problem (Q2489306) (← links)