Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
From MaRDI portal
Publication:5713901
DOI10.1007/b96957zbMath1094.90578OpenAlexW2498803556MaRDI QIDQ5713901
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
Related Items (16)
Petroleum supply planning: reformulations and a novel decomposition algorithm ⋮ Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem ⋮ An integrated method for planning and scheduling to minimize tardiness ⋮ Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification ⋮ Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems ⋮ Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ Collaborative Operating Room Planning and Scheduling ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ Single-facility scheduling by logic-based Benders decomposition ⋮ Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling ⋮ A robust disaster preparedness model for effective and fair disaster response ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ Multi-warehouse package consolidation for split orders in online retailing ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ Exact optimization and decomposition approaches for shelf space allocation ⋮ Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs
This page was built for publication: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
