Pages that link to "Item:Q2329719"
From MaRDI portal
The following pages link to The incremental connected facility location problem (Q2329719):
Displaying 12 items.
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- The multi-period incremental service facility location problem (Q960382) (← links)
- The online multicommodity connected facility location problem (Q1644930) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- A two-level off-grid electric distribution problem on the continuous space (Q2147125) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers (Q2669739) (← links)
- On the Asymmetric Connected Facility Location Polytope (Q3195346) (← links)
- An incremental algorithm for the uncapacitated facility location problem (Q4565762) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems (Q6568492) (← links)