Pages that link to "Item:Q811347"

The following pages link to A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347):

Displaying 50 items.

• Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
• Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches (Q337674) (← links)
• Observations on some heuristic methods for the capacitated facility location problem (Q505112) (← links)
• A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
• Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis (Q535673) (← links)
• The convex hull of two core capacitated network design problems (Q689128) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
• A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
• A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
• Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort (Q856273) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• Lower bounds for the two-stage uncapacitated facility location problem (Q864032) (← links)
• A dynamic location problem with maximum decreasing capacities (Q953304) (← links)
• A genetic algorithm for a single product network design model with lead time and safety stock considerations (Q1014964) (← links)
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
• An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
• A Langrangean heuristic for the \(p_ k\)-median dynamic location problem (Q1194737) (← links)
• The capacitated distribution and waste disposal problem (Q1266619) (← links)
• A Lagrangean heuristic for the facility location problem with staircase costs (Q1278582) (← links)
• Environmental integrated production and recycling management (Q1278626) (← links)
• Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
• Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
• Planning and scheduling packaging lines in food industry (Q1309991) (← links)
• Solving the staircase cost facility location problem with decomposition and piecewise linearization (Q1333508) (← links)
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• Polyhedral analysis and decompositions for capacitated plant location-type problems (Q1383369) (← links)
• The capacitated plant location problem (Q1390274) (← links)
• An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
• Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
• A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro (Q1600932) (← links)
• An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
• Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
• Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• Facility location with increasing production costs (Q1869420) (← links)
• Maximal covering code multiplexing access telecommunication networks (Q1876173) (← links)
• Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• The capacitated plant location problem with multiple facilities in the same site (Q1941959) (← links)
• A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem (Q1955409) (← links)
• Solving the facility location and fixed charge solid transportation problem (Q1983711) (← links)
• Solving the weighted capacitated planned maintenance problem and its variants (Q1991204) (← links)
• Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
• Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
• A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)