Using dual presolving reductions to reformulate cumulative constraints

DOI10.1007/S10601-012-9136-9MaRDI QIDQ487651zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cumulative constraintsdual reductionspresolvingvariable locks

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• A first look at picking dual variables for maximizing reduced cost fixing
• Progress in presolving for mixed integer programming
• Redundant cumulative constraints to compute preemptive bounds
• Explaining the \texttt{cumulative} propagator
• scientific article; zbMATH DE number 679862

Cites work

• A constraint integer programming approach for resource-constrained project scheduling
• A context for constraint satisfaction problem formulation selection
• A language and a program for stating and solving combinatorial problems
• A note on detecting simple redundancies in linear systems
• A unifying framework for structural properties of CSPS: definitions, complexity, tractability
• An Approximative Criterion for the Potential of Energetic Reasoning
• An integrated solver for optimization problems
• Automatic Detection of Variable and Value Symmetries
• 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
• Conflict analysis in mixed integer programming
• Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Counting-based search: branching heuristics for constraint satisfaction problems
• Essence: A constraint language for specifying combinatorial problems
• Linear Programming
• Max Energy Filtering Algorithm for Discrete Cumulative Resources
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Redundancy elimination with a lexicographic solved form
• Redundancy in mathematical programming. A state-of-the-art survey
• SCIP: solving constraint integer programs
• Scheduling a single machine to minimize a regular objective function under setup constraints
• Solving RCPSP/max by lazy clause generation
• Solving project scheduling problems by minimum cut computations
• The design of the zinc modelling language

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

Describes a project that uses

Uses Software

• Essence
• Zinc
• BL data set
• MiniZinc
• MIPLIB
• CHIP
• SCIP
• PSPLIB

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)