The following pages link to Bernard Gendron (Q210510):
Displaying 50 items.
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks (Q323507) (← links)
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
- Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem (Q398914) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
- Modeling and solving a logging camp location problem (Q748565) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem (Q943796) (← links)
- Formulations and relaxations for a multi-echelon capacitated location-distribution problem (Q960381) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements (Q1370711) (← links)
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements (Q1413762) (← links)
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem'' (Q1600948) (← links)
- Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem (Q1606886) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
- A general variable neighborhood search for the swap-body vehicle routing problem (Q1652113) (← links)
- Real-time management of transportation disruptions in forestry (Q1652295) (← links)
- Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints (Q1652382) (← links)
- Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
- A general variable neighborhood search variants for the travelling salesman problem with draft limits (Q1677289) (← links)
- A two-stage stochastic programming approach for multi-activity tour scheduling (Q1683088) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design (Q1771210) (← links)
- A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- Total domination and the Caccetta-Häggkvist conjecture (Q1926487) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model (Q2116857) (← links)
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
- Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel (Q2183333) (← links)
- Dynamic and stochastic rematching for ridesharing systems: formulations and reductions (Q2225063) (← links)
- Quasi-separable Dantzig-Wolfe reformulations for network design (Q2225066) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- On edge orienting methods for graph coloring (Q2385485) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- Formal languages for integer programming modeling of shift scheduling problems (Q2430360) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
- A taxonomy of multilayer network design and a survey of transportation and telecommunication applications (Q2673552) (← links)
- A Lagrangian decomposition scheme for choice-based optimization (Q2676388) (← links)
- Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling (Q2883642) (← links)
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616) (← links)
- Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling (Q3005674) (← links)
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems (Q3114873) (← links)
- Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements (Q3142069) (← links)
