Pages that link to "Item:Q3114903"

The following pages link to A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem (Q3114903):

Displaying 33 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
• Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
• Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
• A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources (Q716354) (← links)
• Scatter search for the single source capacitated facility location problem (Q940848) (← links)
• A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem (Q954046) (← links)
• The design of robust value-creating supply chain networks: a critical review (Q1046092) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• The capacitated mobile facility location problem (Q1737488) (← links)
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
• A new extended formulation with valid inequalities for the capacitated concentrator location problem (Q2029271) (← links)
• A dual RAMP algorithm for single source capacitated facility location problems (Q2240710) (← links)
• Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
• An exact approach for cyclic inbound inventory routing in a level production system (Q2294631) (← links)
• Combining very large scale and ILP based neighborhoods for a two-level location problem (Q2356178) (← links)
• Tariff concessions in production sourcing (Q2463506) (← links)
• Optimizing over the split closure (Q2476990) (← links)
• Lower and upper bounds for a two-stage capacitated facility location problem with handling costs (Q2514748) (← links)
• Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem (Q2815453) (← links)
• Exactly solving a two-level location problem with modular node capacities (Q2892154) (← links)
• Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems (Q5283361) (← links)
• A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)
• A faster FPTAS for knapsack problem with cardinality constraint (Q5970810) (← links)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
• Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation (Q6109334) (← links)
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)
• Enhanced capacitated facility location problem for mental accounting management using partial resource concentration (Q6546998) (← links)