The following pages link to Xavier Gandibleux (Q319372):
Displaying 30 items.
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function (Q862814) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- Multicriteria approach for intelligent decision support in supervisory control (Q1339189) (← links)
- GRASP for set packing problems. (Q1420382) (← links)
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case (Q1595283) (← links)
- A population-based algorithm for solving linear assignment problems with two objectives (Q1652173) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- Interactive multicriteria procedure exploiting a knowledge-based module to select electricity production alternatives: The CASTART system (Q1807945) (← links)
- A survey and annotated bibliography of multiobjective combinatorial optimization (Q1841810) (← links)
- Stability evaluation of a railway timetable at station level (Q2378419) (← links)
- Preface. Multiobjective discrete and combinatorial optimization (MODCO) (Q2379861) (← links)
- Two phase algorithms for the bi-objective assignment problem (Q2455615) (← links)
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm (Q2496036) (← links)
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem (Q2655608) (← links)
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme (Q2899069) (← links)
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
- (Q3109954) (← links)
- A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm (Q3112556) (← links)
- RECIFE: A MCDSS for Railway Capacity Evaluation (Q3556545) (← links)
- A Robust-Solution-Based Methodology to Solve Multiple-Objective Problems with Uncertainty (Q3649610) (← links)
- (Q4424281) (← links)
- (Q4546412) (← links)
- (Q4546413) (← links)
- (Q4666988) (← links)
- (Q4670576) (← links)
- Evolutionary Multi-Criterion Optimization (Q5709907) (← links)
