Pages that link to "Item:Q3206665"

The following pages link to A direct dual method for the mixed plant location problem with some side constraints (Q3206665):

Displaying 28 items.

• 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)
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem (Q811344) (← links)
• A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
• Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
• A dynamic location problem with maximum decreasing capacities (Q953304) (← links)
• Heuristics for the capacitated plant location model (Q1051554) (← links)
• Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
• On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
• Simple plant location under uniform delivered pricing (Q1148201) (← links)
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem (Q1171987) (← links)
• Location and sizing of offshore platforms for oil exploration (Q1194731) (← links)
• An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies (Q1198290) (← links)
• Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
• The capacitated plant location problem (Q1390274) (← links)
• The design of reverse distribution networks: Models and solution procedures (Q1400663) (← links)
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. (Q1406697) (← links)
• A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem'' (Q1600948) (← 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)
• RAMP algorithms for the capacitated facility location problem (Q2240709) (← links)
• A heuristic preprocessor supported algorithm for the capacitated plant location problem (Q2276874) (← links)
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems (Q2640440) (← links)
• A dual ascent approach for steiner tree problems on a directed graph (Q3315294) (← links)
• Capacitated facility location/network design problems. (Q5928375) (← links)