New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
From MaRDI portal
Publication:890005
DOI10.1007/s10601-015-9191-0zbMath1327.90130OpenAlexW1981307534MaRDI QIDQ890005
Jean-Guillaume Fages, Hadrien Cambazard
Publication date: 9 November 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-015-9191-0
Related Items (4)
Constraint programming and operations research ⋮ A Lagrangian propagator for artificial neural networks in constraint programming ⋮ Enriching Solutions to Combinatorial Problems via Solution Engineering ⋮ Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved filtering for weighted circuit constraints
- New bundle methods for solving Lagrangian relaxation dual problems
- A shortest path-based approach to the multileaf collimator sequencing problem
- Filtering algorithms for the NValue constraint
- Soft arc consistency revisited
- Constraint programming based Lagrangian relaxation for the automatic recording problem
- Personnel scheduling: a literature review
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
- Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction
- Sequencing and Counting with the multicost-regular Constraint
- A Dual-Based Procedure for Uncapacitated Facility Location
- Technical Note—An Algorithm for the p-Median Problem
- A Lagrangian Relaxation for Golomb Rulers
- The traveling-salesman problem and minimum spanning trees: Part II
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
