Branch and Bound Experiments in Convex Nonlinear Integer Programming
From MaRDI portal
Recommendations
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
- A branch and bound algorithm for a class of non-convex programming problems
- A branch and bound algorithm for solving separable convex integer programming problems
- A branch and bound algorithm for integer separable concave programs
- scientific article; zbMATH DE number 4008100
- A branch and bound method for solving integer separable concave problems
- On branching rules for convex mixed-integer nonlinear optimization
- scientific article; zbMATH DE number 3902395
- Some branch and bound techniques for nonlinear optimization
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
Cited in
(86)- Genomic feature selection by coverage design optimization
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Solving a problem of the choice of products by means of the branch and bound method
- Efficient and robust optimal design for quantile regression based on linear programming
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Mixed integer nonlinear programming tools: a practical overview
- Polyhedral approximation in mixed-integer convex optimization
- A trust region SQP algorithm for mixed-integer nonlinear programming
- Non-linear integer programming: Sensitivity analysis for branch and bound
- A note on solving quadratic programs using mixed-integer programming
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- Optimization methods for mixed integer weakly concave programming problems
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- A mean-risk mixed integer nonlinear program for transportation network protection
- Constructing lattice-free gradient polyhedra in dimension two
- Budget constrained model selection for multiple linear regression
- Cutting plane algorithm for convex generalized disjunctive programs
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- A hybrid approach to resolving a differentiable integer program.
- Constructing lattice-free gradient polyhedra in dimension two
- An algorithmic framework for convex mixed integer nonlinear programs
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- On branching rules for convex mixed-integer nonlinear optimization
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
- An algorithm for indefinite integer quadratic programming
- Inversion of convection-diffusion equation with discrete sources
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Conflict Analysis for MINLP
- Monotonic optimization techniques for solving knapsack problems
- Discrete optimization by optimal control methods. I: Separable problems
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- Ellipsoid bounds for convex quadratic integer programming
- Capacity planning in networks of queues with manufacturing applications
- A branch and bound algorithm for solving separable convex integer programming problems
- Nesting planning based on production priorities and technological efficiency
- Optimizing reliability and service parts logistics for a time-varying installed base
- A multiplicative weights update algorithm for MINLP
- Discrete filled function method for discrete global optimization
- Optimal-constrained multicast sub-graph over coded packet networks
- Solving house allocation problems with risk-averse agents
- An optimal plan of zero-defect single-sampling by attributes for incoming inspections in assembly lines
- The supporting hyperplane optimization toolkit for convex MINLP
- A disjunctive cut strengthening technique for convex MINLP
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Discrete global optimization problems with a modified discrete filled function
- Cost optimization of industrial steel building structures
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- A discrete dynamic convexized method for nonlinear integer programming
- Optimization of a complex flexible multibody systems with composite materials
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques
- On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem
- Extended formulations in mixed-integer convex programming
- On the relationship between the integer and continuous solutions of convex programs
- Partially distributed outer approximation
- A nonlinear Lagrangian dual for integer programming
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- Mixed integer programming with a class of nonlinear convex constraints
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Minotaur: a mixed-integer nonlinear optimization toolkit
- A new node selection strategy in the branch-and-bound procedure
- The oracle penalty method
- When is rounding allowed in integer nonlinear optimization?
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
- An efficient algorithm for multi-dimensional nonlinear knapsack problems
- An approximate algorithm for nonlinear integer programming
- Logarithmic-exponential penalty formulation for integer programming
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- Identifying a global optimizer with filled function for nonlinear integer programming
- A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems
- Wasserstein distributionally robust shortest path problem
- Modeling without categorical variables: a mixed-integer nonlinear program for the optimization of thermal insulation systems
- An exact solution method for reliability optimization in complex systems
- Extended formulations in mixed integer conic quadratic programming
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Facility location problems on graphs with non-convex neighborhoods
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- Mixed integer nonlinear programming tools: an updated practical overview
This page was built for publication: Branch and Bound Experiments in Convex Nonlinear Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720299)
