Pages that link to "Item:Q1044245"

The following pages link to An effective heuristic for large-scale capacitated facility location problems (Q1044245):

Displaying 33 items.

• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• 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)
• A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
• A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
• On solving large instances of the capacitated facility location problem (Q859676) (← links)
• Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• The capacitated mobile facility location problem (Q1737488) (← links)
• A computational study of a nonlinear minsum facility location problem (Q1761206) (← links)
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
• An aggregation heuristic for large scale p-median problem (Q1762151) (← 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)
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type (Q1809805) (← links)
• Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
• Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
• Near-optimal large-scale k-medoids clustering (Q2054038) (← links)
• RAMP algorithms for the capacitated facility location problem (Q2240709) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• Capacitated facility location problem with general setup cost (Q2496021) (← links)
• MapReduce based location selection algorithm for utility maximization with capacity constraints (Q2517294) (← links)
• Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem (Q2676294) (← links)
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
• (Q3085407) (← links)
• A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems (Q3161792) (← links)
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem (Q3505940) (← links)
• (Q4792361) (← links)
• Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning (Q5111126) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Semi-supervised \(k\)-means clustering via DC programming approach (Q6134046) (← links)