Using dual presolving reductions to reformulate cumulative constraints
type: Item
instance of: scholarly article
title: Using dual presolving reductions to reformulate cumulative constraints
zbMATH Open document ID: 1309.90066
author: Stefan Heinz
author: Jens Schulz
author: J. Christopher Beck
published in: Constraints
publication date: 2015-01-22T00:00:00Z
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6389807
zbMATH Keywords: dual reductions
zbMATH Keywords: cumulative constraints
zbMATH Keywords: presolving
zbMATH Keywords: variable locks
describes a project that uses: MIPLIB
describes a project that uses: Zinc
describes a project that uses: Essence
describes a project that uses: MiniZinc
describes a project that uses: SCIP
describes a project that uses: PSPLIB
describes a project that uses: CHIP
describes a project that uses: BL data set
MaRDI profile type: Publication
full work available at URL: s10601-012-9136-9
OpenAlex ID: W1972237262
cites work: Conflict analysis in mixed integer programming
cites work: SCIP: solving constraint integer programs
cites work: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems.
cites work: Scheduling a single machine to minimize a regular objective function under setup constraints
cites work: A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
cites work: An Approximative Criterion for the Potential of Energetic Reasoning
cites work: A note on detecting simple redundancies in linear systems
cites work: Q3624142
cites work: A context for constraint satisfaction problem formulation selection
cites work: Linear Programming
cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
cites work: Essence: A constraint language for specifying combinatorial problems
cites work: Redundancy elimination with a lexicographic solved form
cites work: Redundancy in mathematical programming. A state-of-the-art survey
cites work: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
cites work: A language and a program for stating and solving combinatorial problems
cites work: The design of the zinc modelling language
cites work: Solving Project Scheduling Problems by Minimum Cut Computations
cites work: Counting-based search: branching heuristics for constraint satisfaction problems
cites work: Automatic Detection of Variable and Value Symmetries
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Solving RCPSP/max by lazy clause generation
cites work: Max Energy Filtering Algorithm for Discrete Cumulative Resources
cites work: An Integrated Solver for Optimization Problems
DOI: 10.1007/S10601-012-9136-9
description: scientific article; zbMATH DE number 6389807