Pages that link to "Item:Q4060779"
From MaRDI portal
The following pages link to Multicommodity Distribution System Design by Benders Decomposition (Q4060779):
Displaying 50 items.
- Hub location problems with price sensitive demands (Q264310) (← links)
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints (Q320803) (← links)
- Cold supply chain design with environmental considerations: a simulation-optimization approach (Q322665) (← links)
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← links)
- Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels (Q322784) (← links)
- Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction (Q336520) (← links)
- Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
- A distribution network design problem in the automotive industry: MIP formulation and heuristics (Q337173) (← links)
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
- A multivariate adaptive regression splines cutting plane approach for solving a two-stage stochastic programming fleet assignment model (Q421728) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany (Q439490) (← links)
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- Integrated supply chain planning under uncertainty using an improved stochastic approach (Q636501) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry (Q742505) (← links)
- Modeling and solving a logging camp location problem (Q748565) (← links)
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints (Q761340) (← links)
- Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization (Q779756) (← links)
- A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences (Q780181) (← links)
- Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
- A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475) (← links)
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type (Q811349) (← links)
- Modelling a fertiliser distribution system (Q811356) (← links)
- Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
- Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem (Q853803) (← 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)
- Designing two-echelon supply networks (Q859921) (← links)
- The stochastic location model with risk pooling (Q864042) (← links)
- An integrated model for logistics network design (Q867539) (← links)
- A review of hierarchical facility location models (Q868995) (← links)
- A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem (Q881527) (← links)
- Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches (Q883301) (← links)
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
- Constructing integer programming models by the predicate calculus (Q918417) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- An efficient generalized network-simplex-based algorithm for manufacturing network flows (Q927190) (← links)
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations (Q938004) (← links)
- Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
- Integral analysis method - IAM (Q1011236) (← links)
