The following pages link to Mathieu Van Vyve (Q403667):
Displayed 27 items.
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- A heuristic method to schedule training programs for small and medium enterprises (Q439435) (← links)
- Strong and compact relaxations in the original space using a compact extended formulation (Q458127) (← links)
- (Q592521) (redirect page) (← links)
- Mixing MIR inequalities with two divisible coefficients (Q964181) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- Fixed-charge transportation problems on trees (Q1728231) (← links)
- On the on-line maintenance scheduling problem (Q1744635) (← links)
- Efficient approximation schemes for economic lot-sizing in continuous time (Q1751154) (← links)
- Revisiting minimum profit conditions in uniform price day-ahead electricity auctions (Q1754186) (← links)
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis) (Q1878999) (← links)
- A MIP framework for non-convex uniform price day-ahead electricity auctions (Q2397767) (← links)
- Fixed-charge transportation on a path: optimization, LP formulations and separation (Q2434997) (← links)
- A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity (Q2494508) (← links)
- Approximate extended formulations (Q2583138) (← links)
- Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions (Q2630112) (← links)
- A sequential Stackelberg game for dynamic inspection problems (Q2672097) (← links)
- A General Heuristic for Production Planning Problems (Q2890430) (← links)
- Securely Solving Classical Network Flow Problems (Q2942837) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Fixed-Charge Transportation on a Path: Linear Programming Formulations (Q3009780) (← links)
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size (Q5388050) (← links)
- The Continuous Mixing Polyhedron (Q5704230) (← links)
- Practically Efficient Secure Single-Commodity Multi-market Auctions (Q5857771) (← links)
- Stronger path‐based extended formulation for the Steiner tree problem (Q6068530) (← links)
- Convex Hull, IP and European Electricity Pricing in a European Power Exchanges setting with efficient computation of Convex Hull Prices (Q6299793) (← links)