Pages that link to "Item:Q3757690"
From MaRDI portal
The following pages link to An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690):
Displayed 36 items.
- Retrofit of multiproduct batch plants through generalized disjunctive programming (Q597504) (← links)
- An assembly-type supply chain system controlled by kanbans under a just-in-time delivery policy (Q707140) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← links)
- Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy (Q818091) (← links)
- Rehabilitation and replacement of water distribution system components considering uncertainties (Q922148) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems (Q1110993) (← links)
- New algorithms for product positioning (Q1291641) (← links)
- Different transformations for solving non-convex trim-loss problems by MINLP (Q1291782) (← links)
- An improved branch and bound algorithm for mixed integer nonlinear programs (Q1318452) (← links)
- Solving mixed integer nonlinear programs by outer approximation (Q1337138) (← links)
- Interactions between nonlinear programming and modeling systems (Q1365050) (← 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)
- A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
- Mixed integer programming for a special logic constrained optimal control problem (Q1780957) (← links)
- A multiperiod approach to the solution of groundwater management problems using an outer approximation method (Q1877072) (← links)
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands (Q1906277) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Linearization of mixed-integer products (Q2277364) (← links)
- An MINLP retrofit approach for improving the flexibility of heat exchanger networks (Q2368097) (← links)
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks (Q2368099) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)
- Constraint partitioning in penalty formulations for solving temporal planning problems (Q2457638) (← 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)
- Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
- A local relaxation approach for the siting of electrical substations (Q2506167) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- An optimization method for solving mixed discrete-continuous programming problems (Q2519622) (← links)
- A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
- A two‐step method for mixed‐integer nonlinear programming problems (Q4009311) (← links)
- (Q4253792) (← links)