The following pages link to Lucas Létocart (Q338863):
Displayed 20 items.
- Fast machine reassignment (Q338866) (← links)
- A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities (Q510949) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Multicuts and integral multiflows in rings (Q1041998) (← links)
- (Q1758873) (redirect page) (← links)
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming (Q1758875) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- A greedy algorithm for multicut and integral multiflow in rooted trees (Q1869999) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- Solving the electricity production planning problem by a column generation based heuristic (Q2434329) (← links)
- Optimizing Time Slot Allocation in Single Operator Home Delivery Problems (Q2806900) (← links)
- Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
- Reduced graphs for min-cut/max-flow approaches in image segmentation (Q2840685) (← links)
- (Q2861513) (← links)
- (Q2865859) (← links)
- A simplicial decomposition framework for large scale convex quadratic programming (Q6287111) (← links)
- A Julia Module for Polynomial Optimization with Complex Variables applied to Optimal Power Flow (Q6317436) (← links)