The following pages link to Martine Labbé (Q208352):
Displaying 50 items.
- Identification of all steady states in large networks by logical analysis (Q253470) (← links)
- Improved integer linear programming formulations for the job sequencing and tool switching problem (Q319452) (← links)
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- (Q607004) (redirect page) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- Valid inequalities and branch-and-cut for the clique pricing problem (Q665989) (← links)
- A note on a stochastic location problem (Q688208) (← links)
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201) (← links)
- An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
- Reduction approaches for robust shortest path problems (Q716356) (← links)
- The continuous center set of a network (Q757234) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Q929154) (← links)
- New formulations and valid inequalities for a bilevel pricing problem (Q935200) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
- (Q1060127) (redirect page) (← links)
- Outcomes of voting and planning in single facility location problems (Q1060128) (← links)
- How bad can a voting locating be (Q1082239) (← links)
- Two-dimensional rectangle packing: On-line methods and results (Q1309806) (← links)
- Approximation algorithms for the capacitated plant allocation problem (Q1332940) (← links)
- Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) (← links)
- Covering a graph with cycles. (Q1406651) (← links)
- Two-connected networks with rings of bounded cardinality (Q1424779) (← links)
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem (Q1652079) (← links)
- Lagrangian relaxation for SVM feature selection (Q1652409) (← links)
- The rank pricing problem: models and branch-and-cut algorithms (Q1722958) (← links)
- New models for the location of controversial facilities: a bilevel programming approach (Q1738822) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Sensitivity analysis in multiple objective linear programming: The tolerance approach (Q1823157) (← links)
- Polyhedral results for two-connected networks with bounded rings (Q1849257) (← links)
- Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives (Q1872011) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- An exact algorithm for the dual bin packing problem (Q1892657) (← links)
- Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem'' (Q1919191) (← links)
- Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
- Exact solution of the SONET ring loading problem (Q1962832) (← links)
- A study of general and security Stackelberg game formulations (Q1999631) (← links)
- Models and algorithms for the product pricing with single-minded customers requesting bundles (Q2027005) (← links)
- Finding the root graph through minimum edge deletion (Q2028798) (← links)
- Coordinating resources in Stackelberg security games (Q2030646) (← links)
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality (Q2039060) (← links)
- The geodesic classification problem on graphs (Q2132333) (← links)
- A bilevel optimization approach to decide the feasibility of bookings in the European gas market (Q2155380) (← links)
- The rank pricing problem with ties (Q2239986) (← links)
- Bookings in the European gas market: characterisation of feasibility and computational complexity results (Q2303532) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
