Constraint programming and operations research
From MaRDI portal
Publication:1616390
DOI10.1007/s10601-017-9280-3zbMath1402.90148OpenAlexW2780406577MaRDI QIDQ1616390
John N. Hooker, Willem-Jan van Hoeve
Publication date: 6 November 2018
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-017-9280-3
Related Items
Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem, Unnamed Item
Uses Software
Cites Work
- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
- Sequencing and Counting with the multicost-regular Constraint
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- Logic-based MultiObjective Optimization for Restoration Planning
- Graph-Based Algorithms for Boolean Function Manipulation
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- An Algorithm for Solving the Job-Shop Problem
- Optimal Capacity Scheduling—I
- State-space relaxation procedures for the computation of bounds to routing problems
- Binary Decision Diagrams
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
- Decision Diagrams and Dynamic Programming
- Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling
- A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects
- Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources
- Target Cuts from Relaxed Decision Diagrams
- Approximate Dynamic Programming
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures
- Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming
- A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
- Constraint Programming Based Column Generation for Employee Timetabling
- Shorter Path Constraints for the Resource Constrained Shortest Path Problem
- Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation
- Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs
- Logic Programming
- MDD Propagation for Sequence Constraints
- Maximum matching in a convex bipartite graph
- Optimal Political Districting by Implicit Enumeration Techniques
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2003
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Recent Advances in Constraints
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Solving the open shop scheduling problem
- Constraint programming based column generation for crew assignment
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Projection, consistency, and George Boole
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem
- Temporal linear relaxation in IBM ILOG CP optimizer
- Decision diagrams for optimization
- Improved filtering for weighted circuit constraints
- Integrated methods for optimization
- Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
- SCIP: solving constraint integer programs
- New filtering algorithms for combinations of among constraints
- Combining column generation and constraint programming to solve the tail assignment problem
- A hybrid method for the planning and scheduling
- An integrated method for planning and scheduling to minimize tardiness
- Integrated methods for optimization.
- A Benders approach for the constrained minimum break problem
- A \texttt{cost-regular} based hybrid column generation approach
- Lagrangian bounds from decision diagrams
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
- Cutting plane algorithms for solving a stochastic edge-partition problem
- Matching theory
- Partitioning procedures for solving mixed-variables programming problems
- The one-machine sequencing problem
- An algorithm for disjunctive programs
- A language and a program for stating and solving combinatorial problems
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling
- A new approach to integrating mixed integer programming and constraint logic programming
- Tight representation of logical constraints as cardinality rules
- Logic cuts for processing networks with fixed charges
- Persistency in maximum cardinality bipartite matchings
- Principles and practice of constraint programming. 2nd international workshop, PPCP '94, Rosario, Orcas Island, Washington, DC, USA, May 2-4, 1994. Proceedings
- Adjustment of heads and tails for the job-shop problem
- Logic-based Benders decomposition
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- On unions and dominants of polytopes
- On not-first/not-last conditions in disjunctive scheduling
- Mixed global constraints and inference in hybrid CLP--IP solvers
- Embedding relaxations in global constraints for solving TSP and TSPTW
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- Automatically improving constraint models in Savile Row
- Hybrid optimization methods for time-dependent sequencing problems
- Introducing global constraints in CHIP
- Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
- Crew assignment via constraint programming: Integrating column generation and heuristic tree search
- Constraint programming based Lagrangian relaxation for the automatic recording problem
- A dynamic programming approach for consistency and propagation for knapsack constraints
- Solving planning and scheduling problems with combined integer and constraint programming
- Computational modeling and problem solving in the networked world. Interfaces in computer science and operations research
- Optimization-oriented global constraints
- Cost-based arc consistency for global cardinality constraints
- Solving VRPTWs with constraint programming based column generation
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- Principles and practice of constraint programming -- CP 1999. 5th international conference, Alexandria, VA, USA, October 11--14, 1999. Proceedings
- Mixed logical-linear programming
- MDDs are efficient modeling tools: an application to some statistical constraints
- A first look at picking dual variables for maximizing reduced cost fixing
- Graph coloring inequalities from all-different systems
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- A Lagrangian propagator for artificial neural networks in constraint programming
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- A polyhedral approach to the \textit{alldifferent} system
- Single-facility scheduling by logic-based Benders decomposition
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints
- Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
- Accelerating column generation for aircraft scheduling using constraint propagation
- On global warming: Flow-based soft global constraints
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Discrete Optimization with Decision Diagrams
- Lagrangian Decomposition via Sub-problem Search
- Scheduling Home Hospice Care with Logic-Based Benders Decomposition
- Constructions and In-Place Operations for MDDs Based Constraints
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
- A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling
- Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Logic, Optimization, and Constraint Programming
- A Hybrid Exact Algorithm for the TSPTW
- Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- Optimization Bounds from Binary Decision Diagrams
- Manipulating MDD Relaxations for Combinatorial Optimization
- Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach
- Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation
- Over-Constrained Problems
- An Integrated Solver for Optimization Problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Encodings of the Sequence Constraint
- Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
- Planning and Scheduling to Minimize Tardiness
- Revisiting the Sequence Constraint
- Hybrid Methods for the Multileaf Collimator Sequencing Problem
- A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
