Pages that link to "Item:Q1410616"

The following pages link to Upper and lower bounds for the single source capacitated location problem. (Q1410616):

Displaying 13 items.

• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
• The single period coverage facility location problem: Lagrangean heuristic and column generation approaches (Q610996) (← links)
• A review of congestion models in the location of facilities with immobile servers (Q859675) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• Scatter search for the single source capacitated facility location problem (Q940848) (← links)
• A memetic algorithm for multi-objective dynamic location problems (Q960114) (← links)
• Capacitated location model with online demand pooling in a multi-channel supply chain (Q992600) (← links)
• Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• The capacitated mobile facility location problem (Q1737488) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem (Q1955409) (← links)