Conflict Analysis for MINLP
From MaRDI portal
Publication:4995080
DOI10.1287/ijoc.2020.1050OpenAlexW3149661229MaRDI QIDQ4995080
Publication date: 23 June 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1050
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal and dual active-set methods for convex quadratic programming
- Solving planning and design problems in the process industry using mixed integer and global optimization
- An algorithmic framework for convex mixed integer nonlinear programs
- Reformulation in mathematical programming: An application to quantum chemistry
- Partitioning procedures for solving mixed-variables programming problems
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- A quadratic assignment formulation of the molecular conformation problem
- Some results concerning post-infeasibility analysis
- Solving mixed integer nonlinear programs by outer approximation
- Convex envelopes of monomials of odd degree
- A polyhedral branch-and-cut approach to global optimization
- Experiments with conflict analysis in mixed integer programming
- Outer approximation with conic certificates for mixed-integer convex problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Information-based branching schemes for binary linear mixed integer problems
- Local rapid learning for integer programs
- A status report on conflict analysis in mixed integer nonlinear programming
- Irreducible infeasible subsystems of semidefinite systems
- Measuring the impact of primal heuristics
- Conflict analysis in mixed integer programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Efficient Intelligent Backtracking Using Linear Programming
- An Automatic Method of Solving Discrete Programming Problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- Optimization Methods in Finance
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Rapid Learning for Binary Programs
- Solving Real-World Linear Programs: A Decade and More of Progress
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- On the Implementation of a Primal-Dual Interior Point Method
- Identifying Minimally Infeasible Subsystems of Inequalities
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The BPMPD interior point solver for convex quadratic problems
- GRASP: a search algorithm for propositional satisfiability
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes
- Mixed Integer Programming: Analyzing 12 Years of Progress
- A Note on Performance Profiles for Benchmarking Software
- Mixed-integer nonlinear optimization
- A tree-search algorithm for mixed integer programming problems
- Benchmarking optimization software with performance profiles.
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
