Conflict Analysis for MINLP
From MaRDI portal
Recommendations
- Conflict analysis in mixed integer programming
- Conflict resolution models and resource minimization problems
- Experiments with conflict analysis in mixed integer programming
- Algorithms for Computing Minimal Conflicts
- A status report on conflict analysis in mixed integer nonlinear programming
- An approach to optimal synthesis in a conflict problem
- Conflict graphs in solving integer programming problems
- scientific article; zbMATH DE number 972676
- An inference procedure for conflict models
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 757674 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 3209723 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A note on performance profiles for benchmarking software
- A polyhedral branch-and-cut approach to global optimization
- A quadratic assignment formulation of the molecular conformation problem
- A status report on conflict analysis in mixed integer nonlinear programming
- A tree-search algorithm for mixed integer programming problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An Automatic Method of Solving Discrete Programming Problems
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Benchmarking optimization software with performance profiles.
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Conflict analysis in mixed integer programming
- Convex envelopes of monomials of odd degree
- Efficient intelligent backtracking using linear programming
- Experiments with conflict analysis in mixed integer programming
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- GRASP: a search algorithm for propositional satisfiability
- Identifying Minimally Infeasible Subsystems of Inequalities
- Information-based branching schemes for binary linear mixed integer problems
- Irreducible infeasible subsystems of semidefinite systems
- Local rapid learning for integer programs
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Measuring the impact of primal heuristics
- Mixed integer programming: analyzing 12 years of progress
- Mixed-integer nonlinear optimization
- Mixed-integer programming for cycle detection in nonreversible Markov processes
- On the Implementation of a Primal-Dual Interior Point Method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimization Methods in Finance
- Outer approximation with conic certificates for mixed-integer convex problems
- Partitioning procedures for solving mixed-variables programming problems
- Primal and dual active-set methods for convex quadratic programming
- Rapid learning for binary programs
- Reformulation in mathematical programming: An application to quantum chemistry
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Solving Real-World Linear Programs: A Decade and More of Progress
- Solving mixed integer nonlinear programs by outer approximation
- Solving planning and design problems in the process industry using mixed integer and global optimization
- Some results concerning post-infeasibility analysis
- The BPMPD interior point solver for convex quadratic problems
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
Cited in
(2)
Describes a project that uses
Uses Software
This page was built for publication: Conflict Analysis for MINLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995080)
