The following pages link to Gilles Pesant (Q239561):
Displaying 41 items.
- Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
- Learning optimal decision trees using constraint programming (Q823772) (← links)
- New filtering algorithms for combinations of among constraints (Q842795) (← links)
- A \texttt{cost-regular} based hybrid column generation approach (Q857889) (← links)
- Reasoning about solids using constraint logic programming (Q1284708) (← links)
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883) (← links)
- An optimal strategy for the Constrained Cycle Cover Problem (Q1601929) (← links)
- Accelerating counting-based search (Q1626732) (← links)
- A comparison of optimization methods for multi-objective constrained bin packing problems (Q1626770) (← links)
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
- A general approach to the physician rostering problem (Q1854760) (← links)
- A constraint programming framework for local search methods (Q1854899) (← links)
- Solving VRPTWs with constraint programming based column generation (Q1876537) (← links)
- Heuristics for finding \(k\)-clubs in an undirected graph (Q1977620) (← links)
- Counting weighted spanning trees to solve constrained minimum spanning tree problems (Q2011588) (← links)
- An exact CP approach for the cardinality-constrained Euclidean minimum sum-of-squares clustering problem (Q2110413) (← links)
- On the usefulness of linear modular arithmetic in constraint programming (Q2117225) (← links)
- Measures of balance in combinatorial optimization (Q2168777) (← links)
- Practically uniform solution sampling in constraint programming (Q2170209) (← links)
- Leveraging cluster backbones for improving MAP inference in statistical relational models (Q2202525) (← links)
- Solution counting algorithms for constraint-centered search heuristics (Q2272161) (← links)
- Using cost-based solution densities from TSP relaxations to solve routing problems (Q2327249) (← links)
- Improving probabilistic inference in graphical models with determinism and cycles (Q2360970) (← links)
- On global warming: Flow-based soft global constraints (Q2506232) (← links)
- A constraint programming primer (Q2513743) (← links)
- An Optimal Strategy for the Constrained Cycle Cover Problem (Q2741265) (← links)
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows (Q2783791) (← links)
- Achieving Domain Consistency and Counting Solutions for Dispersion Constraints (Q2802248) (← links)
- Balancing Nursing Workload by Constraint Programming (Q2815113) (← links)
- A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling (Q2830948) (← links)
- Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems (Q2887069) (← links)
- On Counting Lattice Points and Chvátal-Gomory Cutting Planes (Q3003282) (← links)
- Recovering Indirect Solution Densities for Counting-Based Branching Heuristics (Q3003285) (← links)
- A general multi-shift scheduling system (Q4681719) (← links)
- Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios (Q4995062) (← links)
- The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints (Q5085468) (← links)
- Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Q5094015) (← links)
- From Support Propagation to Belief Propagation in Constraint Programming (Q5232785) (← links)
- Revisiting Counting Solutions for the Global Cardinality Constraint (Q5235474) (← links)
- Fairness over time in dynamic resource allocation with an application in healthcare (Q6120930) (← links)
- The Synchronized Dynamic Vehicle Dispatching Problem (Q6160388) (← links)
