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):
Displaying 50 items.
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- Wasserstein distributionally robust shortest path problem (Q2301929) (← links)
- Optimal exact designs of experiments via mixed integer nonlinear programming (Q2302472) (← links)
- Ten years of feasibility pump, and counting (Q2329705) (← links)
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) (← links)
- Optimal design of multi-echelon supply chain networks under normally distributed demand (Q2347597) (← links)
- Optimal location of green zones in metropolitan areas to control the urban heat island (Q2352331) (← links)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
- Natural gas production network infrastructure development under uncertainty (Q2358131) (← links)
- Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← 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)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and~gradual uncertainty resolution (Q2393472) (← links)
- A partial outer convexification approach to control transmission lines (Q2419514) (← links)
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition (Q2420817) (← links)
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems (Q2442076) (← links)
- The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems (Q2442095) (← links)
- Finding multiple optimal solutions of signomial discrete programming problems with free variables (Q2443364) (← 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)
- Shape and discrete sizing optimization of timber trusses by considering of joint flexibility (Q2654498) (← links)
- Supply capacity acquisition and allocation with uncertain customer demands (Q2655615) (← links)
- Solving a production-routing problem with price-dependent demand using an outer approximation method (Q2664354) (← links)
- Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness (Q2668664) (← links)
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times (Q2668748) (← links)
- Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster (Q2668769) (← links)
- On the approximation of unbounded convex sets by polyhedra (Q2671446) (← links)
- Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution (Q2676299) (← links)
- Hub location problem considering spoke links with incentive-dependent capacities (Q2676359) (← links)
- Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand (Q2676371) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming (Q2897293) (← links)
- Perspective Reformulation and Applications (Q2897294) (← links)
- Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← links)
- An Algorithmic Framework for MINLP with Separable Non-Convexity (Q2897302) (← links)
- Interactive dynamic optimization server – connecting one modelling language with many solvers (Q2926076) (← links)
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs (Q2967613) (← links)
- Route optimization for multiple searchers (Q3065632) (← links)
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
