Optimization methods for mixed integer weakly concave programming problems
From MaRDI portal
(Redirected from Publication:489113)
Recommendations
- Global optimality conditions for mixed integer weakly concave programming problems
- A new local and global optimization method for mixed integer quadratic programming problems
- Global optimality conditions for some classes of optimization problems
- Global optimality conditions for mixed integer quadratic programming problems
- Sufficient global optimality conditions for general mixed integer nonlinear programming problems
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 3748730 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 549930 (Why is no real title available?)
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 1101647 (Why is no real title available?)
- A Successive Underestimation Method for Concave Minimization Problems
- A branch-and-cut method for 0-1 mixed convex programming
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A novel filled function method and quasi-filled function method for global optimization
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An improved branch and bound algorithm for mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Constrained discriminant analysis via \(0/1\) mixed integer programming
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Global optimality conditions for mixed integer weakly concave programming problems
- Global optimality conditions for mixed nonconvex quadratic programs†
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Handbook of global optimization
- Handbook of global optimization. Vol. 2
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Introduction to global optimization.
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- On the construction of test problems for concave minimization algorithms
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
- Quadratic knapsack problems
- Regularity and stability for the mathematical programming problem in Banach spaces
- Solving mixed integer nonlinear programs by outer approximation
- Strong and Weak Convexity of Sets and Functions
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Sufficient global optimality conditions for weakly convex minimization problems
Cited in
(4)- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- scientific article; zbMATH DE number 3900505 (Why is no real title available?)
- A linear mixed integer programming model for \(N\)-vehicle exploration problem
- Global optimality conditions for mixed integer weakly concave programming problems
This page was built for publication: Optimization methods for mixed integer weakly concave programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489113)
