The following pages link to (Q4139967):
Displaying 50 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Strengthening the reliability fixed-charge location model using clique constraints (Q337553) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- Dual ascent: variations of a theme (Q537601) (← links)
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem (Q795714) (← links)
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type (Q811349) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- A Lagrangean dual ascent algorithm for simple plant location problems (Q911446) (← links)
- A method for solving to optimality uncapacitated location problems (Q920004) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- Heuristics for the capacitated plant location model (Q1051554) (← links)
- A tree search algorithm for the multi-commodity location problem (Q1058962) (← links)
- Principal direction search: A new method of search for unconstrained LP formulations (Q1058964) (← links)
- An extension of set partitioning with application to scheduling problems (Q1060959) (← links)
- Facility location models for distribution planning (Q1069423) (← links)
- 'Multidimensional' extensions and a nested dual approach for the m-median problem (Q1072925) (← links)
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location (Q1076603) (← links)
- On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
- A cost operator approach to multistage location-allocation (Q1148206) (← links)
- On a particular problem of service allocation (Q1163980) (← links)
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem (Q1171987) (← links)
- Locational analysis (Q1173002) (← links)
- Fast primal and dual heuristics for the \(p\)-median location problem (Q1176817) (← links)
- Single machine earliness and tardiness scheduling (Q1278531) (← links)
- A branch and bound algorithm for the traveling purchaser problem (Q1278659) (← links)
- Solving the plant location problem on a line by linear programming (Q1284603) (← links)
- Separating lifted odd-hole inequalities to solve the index selection problem (Q1304469) (← links)
- Integer programming formulations of discrete hub location problems (Q1317166) (← links)
- Uncapacitated facility location: General solution procedure and computational experience (Q1333489) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- The capacitated plant location problem (Q1390274) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← 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)
- Facility location with increasing production costs (Q1869420) (← links)
- A monotonic, dual-based bounding procedure for integer programs (Q1894724) (← links)
- A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements (Q1928308) (← links)
- A separation algorithm for the simple plant location problem (Q2060615) (← links)
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (Q2239950) (← links)
- RAMP algorithms for the capacitated facility location problem (Q2240709) (← 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)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
