Pages that link to "Item:Q3337913"
From MaRDI portal
The following pages link to A Decomposition Algorithm for a Discrete Location-Allocation Problem (Q3337913):
Displaying 14 items.
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- Capital budgeting with Benders' decomposition (Q1062887) (← links)
- A discretizing algorithm for location problems (Q1129969) (← links)
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem (Q1327241) (← links)
- Multicommodity flows and Benders decomposition for restricted continuous location problems (Q1754155) (← links)
- Decomposition of the location problem (Q1819693) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions (Q2442081) (← links)
- Capacitated, balanced, sequential location-allocation problems on chains and trees (Q2638927) (← links)
- (Q3352833) (← links)
- (Q5285191) (← links)
- Decomposition strategies for large-scale continuous location–allocation problems (Q5427774) (← links)