Pages that link to "Item:Q1751662"
From MaRDI portal
The following pages link to Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662):
Displayed 17 items.
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- Optimization for <i>L</i><sub>1</sub>-Norm Error Fitting via Data Aggregation (Q4995061) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)
