The following pages link to Martine Labbé (Q208352):
Displaying 50 items.
- Mixed integer linear programming for feature selection in support vector machine (Q2414473) (← links)
- The balanced minimum evolution problem under uncertain data (Q2446823) (← links)
- Optimization models for the single delay management problem in public transportation (Q2482752) (← links)
- A strengthened formulation for the simple plant location problem with order (Q2643785) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- Mixed-integer formulations for the capacitated rank pricing problem with envy (Q2669780) (← links)
- Multi-market portfolio optimization with conditional value at risk (Q2670592) (← links)
- Product line optimization with multiples sites (Q2676378) (← links)
- Two simple algorithms for bin covering (Q2707233) (← links)
- A comparative analysis of several formulations for the generalized minimum spanning tree problem (Q2782729) (← links)
- A bilevel model and solution algorithm for a freight tariff-setting problem (Q2783890) (← links)
- A bilevel model of taxation and its application to optimal highway pricing (Q2784089) (← links)
- The balanced minimum evolution problem (Q2815445) (← links)
- A new formulation and resolution method for the \(p\)-center problem (Q2890410) (← links)
- A class representative model for pure parsimony haplotyping (Q2899051) (← links)
- Solving large \(p\)-median problems with a radius formulation (Q2899146) (← links)
- (Q3030583) (← links)
- Location of an obnoxious facility on a network: A voting approach (Q3032043) (← links)
- (Q3040895) (← links)
- A polyhedral study of the network pricing problem with connected toll arcs (Q3057150) (← links)
- Improved Formulations for the Ring Spur Assignment Problem (Q3091479) (← links)
- Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- On locating path- or tree-shaped facilities on networks (Q3141111) (← links)
- (Q3147665) (← links)
- Projecting the flow variables for hub location problems (Q3156823) (← links)
- (Q3212291) (← links)
- Discussion of Fairness and Implementability in Stackelberg Security Games (Q3297656) (← links)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
- Joint Design and Pricing on a Network (Q3392235) (← links)
- PRICING GEOMETRIC TRANSPORTATION NETWORKS (Q3405968) (← links)
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (Q3418127) (← links)
- Competitive Location with Random Utilities (Q3478233) (← links)
- Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730) (← links)
- The pure parsimony haplotyping problem: overview and computational advances (Q3563606) (← links)
- Generating Facets for the Independence System Polytope (Q3583320) (← links)
- (Q3696816) (← links)
- (Q3755206) (← links)
- Algorithms for Voting and Competitive Location on a Network (Q3818091) (← links)
- A tree-network has the fixed point property (Q3818998) (← links)
- The continuousp-median of a network (Q3830784) (← links)
- (Q3955132) (← links)
- From the median to the generalized center (Q3971961) (← links)
- Capacitated Vehicle Routing on Trees (Q3980515) (← links)
- Heuristics for the 0-1 min-knapsack problem (Q3988807) (← links)
- Market and Locational Equilibrium for Two Competitors (Q3988905) (← links)
- Sensitivity Analysis in Minisum Facility Location Problems (Q4006339) (← links)
- The Voronoi Partition of a Network and Its Implications in Location Theory (Q4024312) (← links)
- (Q4229633) (← links)
- Multicriteria network location problems with sum objectives (Q4242779) (← links)
