The following pages link to Martine Labbé (Q208352):
Displaying 42 items.
- Improved Algorithms for Machine Allocation in Manufacturing Systems (Q4305754) (← links)
- (Q4398373) (← links)
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network (Q4411198) (← links)
- Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
- The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293) (← links)
- The Uncapacitated Facility Location Problem with Client Matching (Q4530658) (← links)
- Solving the Two-Connected Network with Bounded Meshes Problem (Q4530666) (← links)
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies (Q4545694) (← links)
- Network pricing problem with unit toll (Q4565773) (← links)
- A branch-and-cut algorithm for the plant-cycle location problem (Q4661044) (← links)
- (Q4762519) (← links)
- (Q4811395) (← links)
- (Q4867319) (← links)
- Complexity of spanning tree problems with leaf-dependent objectives (Q4887748) (← links)
- Locations on time-varying networks (Q4934867) (← links)
- (Q4955272) (← links)
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization (Q5144791) (← links)
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion (Q5191135) (← links)
- Commuters' Paths with Penalties for Early or Late Arrival Time (Q5202523) (← links)
- (Q5289275) (← links)
- (Q5294055) (← links)
- A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
- Bilevel Programming and Price Setting Problems (Q5391741) (← links)
- Solving the hub location problem in a star–star network (Q5433190) (← links)
- (Q5687198) (← links)
- On the Two-Level Uncapacitated Facility Location Problem (Q5690266) (← links)
- Computing and Combinatorics (Q5716992) (← links)
- The multi-level uncapacitated facility location problem is not submodular (Q5906501) (← links)
- Bilevel programming and price setting problems (Q5917900) (← links)
- Bilevel programming and price setting problems (Q5925163) (← links)
- On generalized minimum spanning trees (Q5945860) (← links)
- Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966287) (← links)
- The multi-level uncapacitated facility location problem is not submodular (Q5967058) (← links)
- Computational comparisons of different formulations for the Stackelberg minimum spanning tree game (Q6070408) (← links)
- Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks (Q6087149) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- Dendrograms, minimum spanning trees and feature selection (Q6167525) (← links)
- Benders decomposition for Network Design Covering Problems (Q6345006) (← links)
- {\lambda}-Cent-Dians and Generalized-Center for Network Design (Q6518532) (← links)
- Integer programming models and polyhedral study for the geodesic classification problem on graphs (Q6556086) (← links)
- Exact and heuristic solution techniques for mixed-integer quantile minimization problems (Q6598945) (← links)
