Solving various weighted matching problems with constraints
From MaRDI portal
Publication:1975207
DOI10.1023/A:1009874519069zbMath0949.90058MaRDI QIDQ1975207
Yves Caseau, François Laburthe
Publication date: 9 April 2000
Published in: Constraints (Search for Journal in Brave)
Related Items (15)
A \texttt{cost-regular} based hybrid column generation approach ⋮ Exact stochastic constraint optimisation with applications in network analysis ⋮ Solving the rectangular assignment problem and applications ⋮ Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. ⋮ An experimental analysis of local minima to improve neighbourhood search. ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Weighted matching as a generic pruning technique applied to optimization constraints ⋮ A Column Generation Model for a Scheduling Problem with Maintenance Constraints ⋮ Experiments with the “Oregon Trail Knapsack Problem” ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ A unified framework for partial and hybrid search methods in constraint programming ⋮ Local adjustments: A general algorithm ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results ⋮ A branch and bound to minimize the number of late jobs on a single machine with release time constraints
This page was built for publication: Solving various weighted matching problems with constraints
