The following pages link to Alain Faye (Q181223):
Displaying 14 items.
- (Q635163) (redirect page) (← links)
- Solving a continuous local access network design problem with a stabilized central column generation approach (Q635164) (← links)
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes (Q724035) (← links)
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
- Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive (Q1786606) (← links)
- A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
- Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
- A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
- Solving the aircraft landing problem with time discretization approach (Q2630256) (← links)
- Partial Lagrangian relaxation for general quadratic programming (Q2644374) (← links)
- (Q4494334) (← links)
- Algorithms – ESA 2005 (Q5475892) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- Decomposition and linearization for 0-1 quadratic programming (Q5933830) (← links)
