Constraint programming and operations research (Q1616390)

From MaRDI portal

Revision as of 06:15, 17 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Constraint programming and operations research	scientific article

Statements

scholarly article

0 references

Constraint programming and operations research (English)

0 references

0 references

Willem-Jan van Hoeve

0 references

0 references

publication date

6 November 2018

0 references

zbMATH Keywords

constraint programming

0 references

operations research

0 references

hybrid optimization

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10601-017-9280-3

0 references

SCIP: solving constraint integer programs

0 references

Constraint Integer Programming: A New Approach to Integrate CP and MIP

0 references

0 references

Binary Decision Diagrams

0 references

0 references

A polyhedral approach to the \textit{alldifferent} system

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound

0 references

Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources

0 references

A first look at picking dual variables for maximizing reduced cost fixing

0 references

On unions and dominants of polytopes

0 references

Constraint-based scheduling: Applying constraint programming to scheduling problems.

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

0 references

An algorithm for disjunctive programs

0 references

Introducing global constraints in CHIP

0 references

0 references

Improved filtering for weighted circuit constraints

0 references

Partitioning procedures for solving mixed-variables programming problems

0 references

Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation

0 references

Multi-stage Benders Decomposition for Optimizing Multicore Architectures

0 references

Theoretical insights and algorithmic tools for decision diagram-based optimization

0 references

MDD Propagation for Sequence Constraints

0 references

Lagrangian bounds from decision diagrams

0 references

Decision diagrams for optimization

0 references

Optimization Bounds from Binary Decision Diagrams

0 references

Discrete Optimization with Decision Diagrams

0 references

Graph coloring inequalities from all-different systems

0 references

Manipulating MDD Relaxations for Combinatorial Optimization

0 references

Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming

0 references

Detecting infeasibility and generating cuts for mixed integer programming using constraint programming

0 references

0 references

Optimal Design of Truss Structures by Logic-Based Branch and Cut

0 references

Encodings of the Sequence Constraint

0 references

0 references

A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times

0 references

Graph-Based Algorithms for Boolean Function Manipulation

0 references

New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach

0 references

Principles and Practice of Constraint Programming – CP 2004

0 references

Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming

0 references

Hybrid Methods for the Multileaf Collimator Sequencing Problem

0 references

Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation

0 references

The one-machine sequencing problem

0 references

An Algorithm for Solving the Job-Shop Problem

0 references

A practical use of Jackson's preemptive schedule for solving the job shop problem

0 references

Adjustment of heads and tails for the job-shop problem

0 references

Single-facility scheduling by logic-based Benders decomposition

0 references

State-space relaxation procedures for the computation of bounds to routing problems

0 references

Lagrangian Decomposition via Sub-problem Search

0 references

A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems

0 references

0 references

Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Branch-and-price and constraint programming for solving a real-life technician dispatching problem

0 references

Persistency in maximum cardinality bipartite matchings

0 references

Combinatorial Benders' Cuts for the Strip Packing Problem

0 references

Principles and Practice of Constraint Programming – CP 2004

0 references

Logic based Benders' decomposition for orthogonal stock cutting problems

0 references

Constraint Programming Based Column Generation for Employee Timetabling

0 references

A \texttt{cost-regular} based hybrid column generation approach

0 references

Solving the open shop scheduling problem

0 references

A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling

0 references

0 references

Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach

0 references

0 references

Constraint programming based column generation for crew assignment

0 references

Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem

0 references

Principles and practice of constraint programming -- CP 1999. 5th international conference, Alexandria, VA, USA, October 11--14, 1999. Proceedings

0 references

0 references

A Hybrid Exact Algorithm for the TSPTW

0 references

Embedding relaxations in global constraints for solving TSP and TSPTW

0 references

Optimization-oriented global constraints

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Combining column generation and constraint programming to solve the tail assignment problem

0 references

Optimal Political Districting by Implicit Enumeration Techniques

0 references

Shorter Path Constraints for the Resource Constrained Shortest Path Problem

0 references

Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation

0 references

Maximum matching in a convex bipartite graph

0 references

Decision Diagrams and Dynamic Programming

0 references

Logic-based MultiObjective Optimization for Restoration Planning

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Accelerating column generation for aircraft scheduling using constraint propagation

0 references

Logic cuts for processing networks with fixed charges

0 references

A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects

0 references

k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach

0 references

Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation

0 references

Lagrangean decomposition: A model yielding stronger lagrangean bounds

0 references

Scheduling Home Hospice Care with Logic-Based Benders Decomposition

0 references

Principles and Practice of Constraint Programming – CP 2004

0 references

A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling

0 references

Over-Constrained Problems

0 references

On global warming: Flow-based soft global constraints

0 references

New filtering algorithms for combinations of among constraints

0 references

Principles and practice of constraint programming. 2nd international workshop, PPCP '94, Rosario, Orcas Island, Washington, DC, USA, May 2-4, 1994. Proceedings

0 references

Logic-based Benders decomposition

0 references

0 references

Logic, Optimization, and Constraint Programming

0 references

Computational modeling and problem solving in the networked world. Interfaces in computer science and operations research

0 references

A hybrid method for the planning and scheduling

0 references

Planning and Scheduling to Minimize Tardiness

0 references

An integrated method for planning and scheduling to minimize tardiness

0 references

Integrated methods for optimization.

0 references

Planning and Scheduling by Logic-Based Benders Decomposition

0 references

Integrated methods for optimization

0 references

Projection, consistency, and George Boole

0 references

Mixed logical-linear programming

0 references

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

0 references

Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

0 references

0 references

Principles and Practice of Constraint Programming – CP 2003

0 references

Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs

0 references

Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach

0 references

Hybrid optimization methods for time-dependent sequencing problems

0 references

Temporal linear relaxation in IBM ILOG CP optimizer

0 references

A language and a program for stating and solving combinatorial problems

0 references

A branch-and-price-and-check model for the vehicle routing problem with location congestion

0 references

A Lagrangian propagator for artificial neural networks in constraint programming

0 references

Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip

0 references

Matching theory

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

0 references

Sequencing and Counting with the multicost-regular Constraint

0 references

0 references

Automatically improving constraint models in Savile Row

0 references

0 references

A computational study of constraint satisfaction for multiple capacitated job shop scheduling

0 references

Mixed global constraints and inference in hybrid CLP--IP solvers

0 references

Constructions and In-Place Operations for MDDs Based Constraints

0 references

MDDs are efficient modeling tools: an application to some statistical constraints

0 references

0 references

Principles and Practice of Constraint Programming – CP 2004

0 references

Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

0 references

Approximate Dynamic Programming

0 references

Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints

0 references

A Benders approach for the constrained minimum break problem

0 references

0 references

Cost-based arc consistency for global cardinality constraints

0 references

Solving a selective dial-a-ride problem with logic-based Benders decomposition

0 references

A new approach to integrating mixed integer programming and constraint logic programming

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Solving VRPTWs with constraint programming based column generation

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates

0 references

Principles and Practice of Constraint Programming – CP 2004

0 references

0 references

Constraint programming based Lagrangian relaxation for the automatic recording problem

0 references

0 references

Crew assignment via constraint programming: Integrating column generation and heuristic tree search

0 references

Logic Programming

0 references

Cutting plane algorithms for solving a stochastic edge-partition problem

0 references

Recent Advances in Constraints

0 references

0 references

Solving planning and scheduling problems with combined integer and constraint programming

0 references

Target Cuts from Relaxed Decision Diagrams

0 references

On not-first/not-last conditions in disjunctive scheduling

0 references

0 references

A dynamic programming approach for consistency and propagation for knapsack constraints

0 references

Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem

0 references

Principles and Practice of Constraint Programming – CP 2003

0 references

Principles and Practice of Constraint Programming – CP 2004

0 references

Revisiting the Sequence Constraint

0 references

Optimal Capacity Scheduling—I

0 references

Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Tight representation of logical constraints as cardinality rules

0 references

An Integrated Solver for Optimization Problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10601-017-9280-3

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1616390

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1616390&oldid=36445451"