Branch and Bound Experiments in Convex Nonlinear Integer Programming
From MaRDI portal
Publication:3720299
DOI10.1287/mnsc.31.12.1533zbMath0591.90065OpenAlexW1997215277MaRDI QIDQ3720299
No author found.
Publication date: 1985
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.31.12.1533
heuristicsupper boundestimationsbranch and bound methodsconvex nonlinear integer programmingpseudo- costs
Numerical mathematical programming methods (65K05) Convex programming (90C25) Integer programming (90C10)
Related Items
Genomic feature selection by coverage design optimization, Minotaur: a mixed-integer nonlinear optimization toolkit, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, Constructing Lattice-Free Gradient Polyhedra in Dimension Two, A disjunctive cut strengthening technique for convex MINLP, Inversion of convection-diffusion equation with discrete sources, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, Solving house allocation problems with risk-averse agents, A branch and bound algorithm for solving separable convex integer programming problems, A new node selection strategy in the branch-and-bound procedure, An optimal plan of zero-defect single-sampling by attributes for incoming inspections in assembly lines, Capacity planning in networks of queues with manufacturing applications, On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem, Extended Formulations in Mixed-Integer Convex Programming, Cutting Plane Algorithm for Convex Generalized Disjunctive Programs, An algorithm for indefinite integer quadratic programming, Mixed integer nonlinear programming tools: an updated practical overview, The supporting hyperplane optimization toolkit for convex MINLP, A multiplicative weights update algorithm for MINLP, A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs, A note on solving quadratic programs using mixed-integer programming, Modeling without categorical variables: a mixed-integer nonlinear program for the optimization of thermal insulation systems, Discrete global descent method for discrete global optimization and nonlinear integer programming, An overview of MINLP algorithms and their implementation in Muriqui optimizer, Nesting planning based on production priorities and technological efficiency, A mean-risk mixed integer nonlinear program for transportation network protection, Discrete global optimization problems with a modified discrete filled function, Facility location problems on graphs with non-convex neighborhoods, Extended formulations in mixed integer conic quadratic programming, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, Ellipsoid Bounds for Convex Quadratic Integer Programming, Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach, Budget constrained model selection for multiple linear regression, A hybrid approach to resolving a differentiable integer program., A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization, A hierarchy of relaxations for nonlinear convex generalized disjunctive programming, Optimizing reliability and service parts logistics for a time-varying installed base, Unnamed Item, Logarithmic-exponential penalty formulation for integer programming, An improved Bernstein global optimization algorithm for MINLP problems with application in process industry, Identifying a global optimizer with filled function for nonlinear integer programming, Discrete optimization by optimal control methods. I: Separable problems, Optimization of a complex flexible multibody systems with composite materials, Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming, Optimization methods for mixed integer weakly concave programming problems, A trust region SQP algorithm for mixed-integer nonlinear programming, A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques, An algorithmic framework for convex mixed integer nonlinear programs, A discrete dynamic convexized method for nonlinear integer programming, Norm bounds and underestimators for unconstrained polynomial integer minimization, Mixed integer programming with a class of nonlinear convex constraints, Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, An efficient algorithm for multi-dimensional nonlinear knapsack problems, Discrete filled function method for discrete global optimization, An approximate algorithm for nonlinear integer programming, The oracle penalty method, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, An exact solution method for reliability optimization in complex systems, Cost optimization of industrial steel building structures, On the relationship between the integer and continuous solutions of convex programs, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, When is rounding allowed in integer nonlinear optimization?, Polyhedral approximation in mixed-integer convex optimization, Partially distributed outer approximation, Extended ant colony optimization for non-convex mixed integer nonlinear programming, Wasserstein distributionally robust shortest path problem, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems, Mixed integer nonlinear programming tools: a practical overview, Conflict Analysis for MINLP, Alternative regularizations for outer-approximation algorithms for convex MINLP, Optimal-constrained multicast sub-graph over coded packet networks, An improved branch and bound algorithm for mixed integer nonlinear programs, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization, A nonlinear Lagrangian dual for integer programming, Constructing lattice-free gradient polyhedra in dimension two, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
