Constraint programming and operations research
type: Item
instance of: scholarly article
title: Constraint programming and operations research
zbMATH Open document ID: 1402.90148
author: John N. Hooker
author: Willem-Jan van Hoeve
published in: Constraints
publication date: 2018-11-06T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6973987
zbMATH Keywords: constraint programming
zbMATH Keywords: operations research
zbMATH Keywords: hybrid optimization
describes a project that uses: G12
describes a project that uses: ILOG SCHEDULE
describes a project that uses: SCIL
describes a project that uses: TSPTW
describes a project that uses: SIMPL
describes a project that uses: CP Optimizer
describes a project that uses: SCIP
describes a project that uses: CHIP
describes a project that uses: MiniZinc
MaRDI profile type: Publication
full work available at URL: s10601-017-9280-3
OpenAlex ID: W2780406577
cites work: SCIP: solving constraint integer programs
cites work: Constraint Integer Programming: A New Approach to Integrate CP and MIP
cites work: Q3056948
cites work: Binary Decision Diagrams
cites work: Q4411347
cites work: A polyhedral approach to the \textit{alldifferent} system
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
cites work: Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources
cites work: A first look at picking dual variables for maximizing reduced cost fixing
cites work: On unions and dominants of polytopes
cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems.
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Q5715680
cites work: An algorithm for disjunctive programs
cites work: Introducing global constraints in CHIP
cites work: Q3241581
cites work: Improved filtering for weighted circuit constraints
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
cites work: Multi-stage Benders Decomposition for Optimizing Multicore Architectures
cites work: Theoretical insights and algorithmic tools for decision diagram-based optimization
cites work: MDD Propagation for Sequence Constraints
cites work: Lagrangian bounds from decision diagrams
cites work: Decision diagrams for optimization
cites work: Optimization Bounds from Binary Decision Diagrams
cites work: Discrete optimization with decision diagrams
cites work: Graph coloring inequalities from all-different systems
cites work: Manipulating MDD Relaxations for Combinatorial Optimization
cites work: Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
cites work: Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
cites work: Q4475632
cites work: Optimal Design of Truss Structures by Logic-Based Branch and Cut
cites work: Encodings of the Sequence Constraint
cites work: Q3993469
cites work: A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming
cites work: Hybrid Methods for the Multileaf Collimator Sequencing Problem
cites work: Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation
cites work: The one-machine sequencing problem
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: Adjustment of heads and tails for the job-shop problem
cites work: Single-facility scheduling by logic-based Benders decomposition
cites work: State-space relaxation procedures for the computation of bounds to routing problems
cites work: Lagrangian Decomposition via Sub-problem Search
cites work: A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
cites work: Q3323698
cites work: Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling
cites work: Branch-and-price and constraint programming for solving a real-life technician dispatching problem
cites work: Persistency in maximum cardinality bipartite matchings

Constraint programming and operations research (cites work)
cites work: Combinatorial Benders' Cuts for the Strip Packing Problem

Constraint programming and operations research (cites work)
cites work: Principles and Practice of Constraint Programming – CP 2004

Constraint programming and operations research (cites work)
cites work: Logic based Benders' decomposition for orthogonal stock cutting problems

Constraint programming and operations research (cites work)
cites work: Constraint Programming Based Column Generation for Employee Timetabling

Constraint programming and operations research (cites work)
cites work: A \texttt{cost-regular} based hybrid column generation approach

Constraint programming and operations research (cites work)
cites work: Solving the open shop scheduling problem

Constraint programming and operations research (cites work)
cites work: A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling

Constraint programming and operations research (cites work)
cites work: Q4475665

Constraint programming and operations research (cites work)
cites work: Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach

Constraint programming and operations research (cites work)
cites work: Q5289267

Constraint programming and operations research (cites work)
cites work: Constraint programming based column generation for crew assignment

Constraint programming and operations research (cites work)
cites work: Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem

Constraint programming and operations research (cites work)
cites work: Principles and practice of constraint programming -- CP 1999. 5th international conference, Alexandria, VA, USA, October 11--14, 1999. Proceedings

Constraint programming and operations research (cites work)
cites work: Q4473026

Constraint programming and operations research (cites work)
cites work: A hybrid exact algorithm for the TSPTW

Constraint programming and operations research (cites work)
cites work: Embedding relaxations in global constraints for solving TSP and TSPTW

Constraint programming and operations research (cites work)
cites work: Optimization-oriented global constraints

Constraint programming and operations research (cites work)
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Constraint programming and operations research (cites work)
cites work: Combining column generation and constraint programming to solve the tail assignment problem

Constraint programming and operations research (cites work)
cites work: Optimal Political Districting by Implicit Enumeration Techniques

Constraint programming and operations research (cites work)
cites work: Shorter Path Constraints for the Resource Constrained Shortest Path Problem

Constraint programming and operations research (cites work)
cites work: Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation

Constraint programming and operations research (cites work)
cites work: Maximum matching in a convex bipartite graph

Constraint programming and operations research (cites work)
cites work: Decision Diagrams and Dynamic Programming

Constraint programming and operations research (cites work)
cites work: Logic-based MultiObjective Optimization for Restoration Planning

Constraint programming and operations research (cites work)
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Constraint programming and operations research (cites work)
cites work: Accelerating column generation for aircraft scheduling using constraint propagation

Constraint programming and operations research (cites work)
cites work: Logic cuts for processing networks with fixed charges

Constraint programming and operations research (cites work)
cites work: A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects

Constraint programming and operations research (cites work)
cites work: k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach

Constraint programming and operations research (cites work)
cites work: Exact solution of graph coloring problems via constraint programming and column generation

Constraint programming and operations research (cites work)
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds

Constraint programming and operations research (cites work)
cites work: Scheduling Home Hospice Care with Logic-Based Benders Decomposition

Constraint programming and operations research (cites work)
cites work: Principles and Practice of Constraint Programming – CP 2004

Constraint programming and operations research (cites work)
cites work: A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling

Constraint programming and operations research (cites work)
cites work: Over-Constrained Problems

Constraint programming and operations research (cites work)
cites work: On global warming: Flow-based soft global constraints

Constraint programming and operations research (cites work)
cites work: New filtering algorithms for combinations of among constraints

Constraint programming and operations research (cites work)
cites work: Principles and practice of constraint programming. 2nd international workshop, PPCP '94, Rosario, Orcas Island, Washington, DC, USA, May 2-4, 1994. Proceedings

Constraint programming and operations research (cites work)
cites work: Logic-based Benders decomposition

Constraint programming and operations research (cites work)
cites work: Q4523706

Constraint programming and operations research (cites work)
cites work: Logic, optimization, and constraint programming

Constraint programming and operations research (cites work)
cites work: Computational modeling and problem solving in the networked world. Interfaces in computer science and operations research

Constraint programming and operations research (cites work)
cites work: A hybrid method for the planning and scheduling

Constraint programming and operations research (cites work)
cites work: Planning and Scheduling to Minimize Tardiness

Constraint programming and operations research (cites work)
cites work: An integrated method for planning and scheduling to minimize tardiness

Constraint programming and operations research (cites work)
cites work: Integrated methods for optimization.

Constraint programming and operations research (cites work)
cites work: Planning and Scheduling by Logic-Based Benders Decomposition

Constraint programming and operations research (cites work)
cites work: Integrated methods for optimization

Constraint programming and operations research (cites work)
cites work: Projection, consistency, and George Boole

Constraint programming and operations research (cites work)
cites work: Mixed logical-linear programming

Constraint programming and operations research (cites work)
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

Constraint programming and operations research (cites work)
cites work: Algorithms for hybrid MILP/CP models for a class of optimization problems

Constraint programming and operations research (cites work)
cites work: Q4495113

Constraint programming and operations research (cites work)
cites work: Principles and Practice of Constraint Programming – CP 2003

Constraint programming and operations research (cites work)
cites work: Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs

Constraint programming and operations research (cites work)
cites work: Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach

Constraint programming and operations research (cites work)
cites work: Hybrid optimization methods for time-dependent sequencing problems

Constraint programming and operations research (cites work)
cites work: Temporal linear relaxation in IBM ILOG CP optimizer

Constraint programming and operations research (cites work)
cites work: A language and a program for stating and solving combinatorial problems

Constraint programming and operations research (cites work)
cites work: A branch-and-price-and-check model for the vehicle routing problem with location congestion

Constraint programming and operations research (cites work)
cites work: A Lagrangian propagator for artificial neural networks in constraint programming

Constraint programming and operations research (cites work)
cites work: Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip

Constraint programming and operations research (cites work)
cites work: Matching theory

Constraint programming and operations research (cites work)
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Constraint programming and operations research (cites work)
cites work: Q4473034

Constraint programming and operations research (cites work)
cites work: Sequencing and Counting with the multicost-regular Constraint

Constraint programming and operations research (cites work)
cites work: Q4737577

Constraint programming and operations research (cites work)
cites work: Automatically improving constraint models in Savile Row

Constraint programming and operations research (cites work)
cites work: Q4849545

Constraint programming and operations research (cites work)
cites work: A computational study of constraint satisfaction for multiple capacitated job shop scheduling

Constraint programming and operations research (cites work)
cites work: Mixed global constraints and inference in hybrid CLP--IP solvers

Constraint programming and operations research (cites work)
cites work: Constructions and In-Place Operations for MDDs Based Constraints

Constraint programming and operations research (cites work)
cites work: MDDs are efficient modeling tools: an application to some statistical constraints

Constraint programming and operations research (cites work)
cites work: Q4475630

Constraint programming and operations research (cites work)
cites work: Principles and Practice of Constraint Programming – CP 2004

Constraint programming and operations research (cites work)
cites work: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

Constraint programming and operations research (cites work)
cites work: Approximate Dynamic Programming

Constraint programming and operations research (cites work)
cites work: Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints

Constraint programming and operations research (cites work)
cites work: A Benders approach for the constrained minimum break problem

Constraint programming and operations research (cites work)
cites work: Q4473038

Constraint programming and operations research (cites work)
cites work: Cost-based arc consistency for global cardinality constraints

Constraint programming and operations research (cites work)
cites work: Solving a selective dial-a-ride problem with logic-based Benders decomposition

Constraint programming and operations research (cites work)
cites work: A new approach to integrating mixed integer programming and constraint logic programming

Constraint programming and operations research (cites work)
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Constraint programming and operations research (cites work)
cites work: Solving VRPTWs with constraint programming based column generation

Constraint programming and operations research (cites work)
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Constraint programming and operations research (cites work)
cites work: Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates

Constraint programming and operations research (cites work)
cites work: Principles and Practice of Constraint Programming – CP 2004

Constraint programming and operations research (cites work)
cites work: Q4796172

Constraint programming and operations research (cites work)
cites work: Constraint programming based Lagrangian relaxation for the automatic recording problem

Constraint programming and operations research (cites work)
cites work: Q4411416

Constraint programming and operations research (cites work)
cites work: Crew assignment via constraint programming: Integrating column generation and heuristic tree search

Constraint programming and operations research (cites work)
cites work: Logic Programming

Constraint programming and operations research (cites work)
cites work: Cutting plane algorithms for solving a stochastic edge-partition problem

Constraint programming and operations research (cites work)
cites work: Recent Advances in Constraints

Constraint programming and operations research (cites work)
cites work: Q4475618

Constraint programming and operations research (cites work)
cites work: Solving planning and scheduling problems with combined integer and constraint programming

Constraint programming and operations research (cites work)
cites work: Target Cuts from Relaxed Decision Diagrams

Constraint programming and operations research (cites work)
cites work: On not-first/not-last conditions in disjunctive scheduling

Constraint programming and operations research (cites work)
cites work: Q3455613

Constraint programming and operations research (cites work)
cites work: A dynamic programming approach for consistency and propagation for knapsack constraints

Constraint programming and operations research (cites work)
cites work: Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem

Constraint programming and operations research (cites work)
cites work: Principles and Practice of Constraint Programming – CP 2003

Constraint programming and operations research (cites work)
cites work: Principles and Practice of Constraint Programming – CP 2004

Constraint programming and operations research (cites work)
cites work: Revisiting the Sequence Constraint

Constraint programming and operations research (cites work)
cites work: Optimal Capacity Scheduling—I

Constraint programming and operations research (cites work)
cites work: Representations of the all\_different predicate of constraint satisfaction in integer programming

Constraint programming and operations research (cites work)
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Constraint programming and operations research (cites work)
cites work: Tight representation of logical constraints as cardinality rules

Constraint programming and operations research (cites work)
cites work: An Integrated Solver for Optimization Problems

Constraint programming and operations research (DOI)
DOI: 10.1007/S10601-017-9280-3