SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
6 references·1 citing·25 second hop
Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem (1988)Lagrangian Relaxation and the Single-Sour…Efficient algorithms for the capacitated concentrator location problem (1987)Efficient algorithms for the …A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints (1986)A Lagrangian Relaxation Heuri…A heuristic lagrangean algorithm for the capacitated plant location problem (1984)A heuristic lagrangean algori…Inverse Optimization: An Application to the Capacitated Plant Location Problem (1981)Inverse Optimization: An Appl…A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem (1980)A Lagrangean Relaxation Algor…A Dual-Based Procedure for Uncapacitated Facility Location (1978)A Dual-Based Procedure for Un…Genetic Algorithms for the Single Source Capacitated Location Problem (2003)Genetic Algorithms for the Si…A Heuristic Program for Locating Warehouses (1963)A Heuristic Program for Locating Warehouses (1976)The simple plant location problem: Survey and synthesis (1983)On the exact solution of large-scale simple plant location problems (1989)Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System (1996)An exact method for the two-echelon, single-source, capacitated facility location problem (2000)Multicommodity Distribution System Design by Benders Decomposition (1974)Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (1977)Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem (1999)A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem (2004)Multicommodity Distribution System Design by Benders Decomposition * † ‡ (2010)Central Facilities Location under an Investment Constraint (1970)Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public (1977)Lagrangean Relaxation Applied to Capacitated Facility Location Problems (1978)Decomposition methods for facility location problems (1986)Approximate solutions to large scale capacitated facility location problems (1990)Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems (1990)Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements (1974)A Graph Partitioning Approach to Airline Crew Scheduling (1985)An extension of set partitioning with application to scheduling problems (1985)The Maximal Covering Location Problem with Capacities on Total Workload (1991)Hub facility location with fixed costs (1992)Network Design and Transportation Planning: Models and Algorithms (1984)Integer programming formulations of discrete hub location problems (1994)Location analysis: A synthesis and survey (2004)
this work references cited by second hop

References

  • 1978A Dual-Based Procedure for Uncapacitated Facility Location910 cited
  • 1987Efficient algorithms for the capacitated concentrator location problem184 cited
  • 1986A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints171 cited
  • 1984A heuristic lagrangean algorithm for the capacitated plant location problem140 cited
  • 1980A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem56 cited
  • 1981Inverse Optimization: An Application to the Capacitated Plant Location Problem29 cited

Cited by

  • 2003Genetic Algorithms for the Single Source Capacitated Location Problem18 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work