Pages that link to "Item:Q3720299"
From MaRDI portal
The following pages link to Branch and Bound Experiments in Convex Nonlinear Integer Programming (Q3720299):
Displayed 32 items.
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Solving house allocation problems with risk-averse agents (Q836964) (← links)
- On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem (Q853084) (← links)
- Discrete global descent method for discrete global optimization and nonlinear integer programming (Q878221) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- The oracle penalty method (Q975775) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Extended ant colony optimization for non-convex mixed integer nonlinear programming (Q1013399) (← links)
- A note on solving quadratic programs using mixed-integer programming (Q1115803) (← links)
- Nesting planning based on production priorities and technological efficiency (Q1129962) (← links)
- An improved branch and bound algorithm for mixed integer nonlinear programs (Q1318452) (← links)
- A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
- A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
- A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs (Q1370656) (← links)
- A hybrid approach to resolving a differentiable integer program. (Q1406652) (← links)
- An exact solution method for reliability optimization in complex systems (Q1772968) (← links)
- A nonlinear Lagrangian dual for integer programming (Q1870020) (← links)
- Capacity planning in networks of queues with manufacturing applications (Q1900269) (← links)
- Logarithmic-exponential penalty formulation for integer programming (Q1961727) (← links)
- Cost optimization of industrial steel building structures (Q2269994) (← links)
- Discrete optimization by optimal control methods. I: Separable problems (Q2457533) (← links)
- Optimization of a complex flexible multibody systems with composite materials (Q2458275) (← links)
- A trust region SQP algorithm for mixed-integer nonlinear programming (Q2463830) (← links)
- Discrete filled function method for discrete global optimization (Q2487474) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
- An efficient algorithm for multi-dimensional nonlinear knapsack problems (Q5423360) (← links)
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)
- An approximate algorithm for nonlinear integer programming (Q5906559) (← links)
- On the relationship between the integer and continuous solutions of convex programs (Q5949923) (← links)