Alain Faye - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2018

A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planesAlain Faye. eor, 270(3):1148-1157, 2018. [doi]

Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentiveDimitri Watel, Alain Faye. TCS, 745:202-223, 2018. [doi]

2015

Solving the Aircraft Landing Problem with time discretization approachAlain Faye. eor, 242(3):1028-1038, 2015. [doi]

2013

Solving the Two-Stage Robust FTTH network design Problem under Demand UncertaintyCedric Hervet, Alain Faye, Marie-Christine Costa, Matthieu Chardy, Stanislas Francfort. endm, 41:335-342, 2013. [doi]

2012

Optimizing splitter and fiber location in a multilevel optical FTTH networkMatthieu Chardy, M. C. Costa, Alain Faye, M. Trampont. eor, 222(3):430-440, 2012. [doi]

2007

Partial Lagrangian relaxation for general quadratic programmingAlain Faye, Frédéric Roupin. 4or, 5(1):75-88, 2007. [doi]

2005

A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment ProblemAlain Faye, Frédéric Roupin. esa 2005: 850-861 [doi]

A polyhedral approach for a constrained quadratic 0-1 problemAlain Faye, Quoc-an Trinh. DAM, 149(1-3):87-100, 2005. [doi]

2003

Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1Alain Faye, Olivier Boyer. rairo, 37(4):249-271, 2003. [doi]

2000

Decomposition and Linearization for 0-1 Quadratic ProgrammingSourour Elloumi, Alain Faye, Éric Soutif. anor, 99(1-4):79-93, 2000. [doi]

1999

A new upper bound for the 0-1 quadratic knapsack problemAlain Billionnet, Alain Faye, Éric Soutif. eor, 112(3):664-672, 1999. [doi]

1997

A Lower Bound for a Constrained Quadratic 0-1 Minimization ProblemAlain Billionnet, Alain Faye. DAM, 74(2):135-146, 1997. [doi]

Sign in or sign up to see more results.

runs on WebDSL