Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
From MaRDI portal
Publication:5713895
DOI10.1007/b96957zbMath1094.90562MaRDI QIDQ5713895
Publication date: 27 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96957
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation, A survey of single machine scheduling to minimize weighted number of tardy jobs, New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem, Minimizing the weighted number of tardy jobs on a single machine with release dates, Scheduling a single machine to minimize a regular objective function under setup constraints, A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
Uses Software