Using dual presolving reductions to reformulate cumulative constraints
From MaRDI portal
Publication:487651
DOI10.1007/S10601-012-9136-9zbMATH Open1309.90066OpenAlexW1972237262MaRDI QIDQ487651FDOQ487651
Authors: Stefan Heinz, Jens Schulz, J. Christopher Beck 
Publication date: 22 January 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-012-9136-9
Recommendations
Cites Work
- SCIP: solving constraint integer programs
- Essence: A constraint language for specifying combinatorial problems
- Conflict analysis in mixed integer programming
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Solving RCPSP/max by lazy clause generation
- The design of the zinc modelling language
- A language and a program for stating and solving combinatorial problems
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Solving project scheduling problems by minimum cut computations
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
- A constraint integer programming approach for resource-constrained project scheduling
- Linear Programming
- Redundancy in mathematical programming. A state-of-the-art survey
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Redundancy elimination with a lexicographic solved form
- Counting-based search: branching heuristics for constraint satisfaction problems
- An Approximative Criterion for the Potential of Energetic Reasoning
- An integrated solver for optimization problems
- Automatic Detection of Variable and Value Symmetries
- A unifying framework for structural properties of CSPS: definitions, complexity, tractability
- Max Energy Filtering Algorithm for Discrete Cumulative Resources
- A note on detecting simple redundancies in linear systems
- A context for constraint satisfaction problem formulation selection
Cited In (8)
- Efficient presolving methods for the influence maximization problem
- A first look at picking dual variables for maximizing reduced cost fixing
- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- Presolving techniques and linear relaxations for cumulative scheduling
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- Domain reduction techniques for global NLP and MINLP optimization
Uses Software
This page was built for publication: Using dual presolving reductions to reformulate cumulative constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487651)
