Pages that link to "Item:Q2516352"
From MaRDI portal
The following pages link to Solving network design problems via iterative aggregation (Q2516352):
Displaying 6 items.
- An aggregate and iterative disaggregate algorithm with proven optimality in machine learning (Q1689569) (← links)
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662) (← links)
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- Optimization for <i>L</i><sub>1</sub>-Norm Error Fitting via Data Aggregation (Q4995061) (← links)
- An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization (Q6173784) (← links)
