Using dual presolving reductions to reformulate cumulative constraints
From MaRDI portal
Publication:487651
DOI10.1007/s10601-012-9136-9zbMath1309.90066OpenAlexW1972237262MaRDI QIDQ487651
J. Christopher Beck, Jens Schulz, Stefan Heinz
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
Related Items
Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Efficient presolving methods for the influence maximization problem, Efficient presolving methods for solving maximal covering and partial set covering location problems, Domain reduction techniques for global NLP and MINLP optimization, Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
Uses Software
Cites Work
- Unnamed Item
- A note on detecting simple redundancies in linear systems
- Redundancy in mathematical programming. A state-of-the-art survey
- SCIP: solving constraint integer programs
- The design of the zinc modelling language
- Essence: A constraint language for specifying combinatorial problems
- A language and a program for stating and solving combinatorial problems
- Redundancy elimination with a lexicographic solved form
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
- Solving RCPSP/max by lazy clause generation
- Conflict analysis in mixed integer programming
- Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems
- An Approximative Criterion for the Potential of Energetic Reasoning
- An Integrated Solver for Optimization Problems
- Solving Project Scheduling Problems by Minimum Cut Computations
- Automatic Detection of Variable and Value Symmetries
- A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
- Max Energy Filtering Algorithm for Discrete Cumulative Resources
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Linear Programming
- A context for constraint satisfaction problem formulation selection
