Pages that link to "Item:Q5558786"
From MaRDI portal
The following pages link to An Algorithm for Separable Nonconvex Programming Problems (Q5558786):
Displaying 50 items.
- Optimal deviations from an asset allocation. (Q1422358) (← links)
- Credal networks (Q1575697) (← links)
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (Q1685576) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- A branch and bound algorithm for solving a class of D-C programming (Q1780534) (← links)
- Progress payments in project scheduling problems. (Q1812008) (← links)
- Subdivision of simplices relative to a cutting plane and finite concave minimization (Q1817320) (← links)
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization (Q1842902) (← links)
- An algorithm for optimizing network flow capacity under economies of scale (Q1843381) (← links)
- Fair transfer price and inventory holding policies in two-enterprise supply chains (Q1848406) (← links)
- Deletion-by-infeasibility rule for DC-constrained global optimization (Q1893323) (← links)
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model (Q1894738) (← links)
- A branch and bound network approach to the canonical constrained entropy problem (Q1900273) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications (Q1938908) (← links)
- A branch-and-bound algorithm embedded with DCA for DC programming (Q1954706) (← links)
- Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
- A combined cutting-stock and lot-sizing problem (Q1969834) (← links)
- Power-to-chemicals: a superstructure problem for sustainable syngas production (Q1979694) (← links)
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
- Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
- Ordering policies of a deteriorating item in an EOQ model under upstream partial order-quantity-dependent trade credit and downstream full trade credit (Q2064745) (← links)
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations (Q2097651) (← links)
- A revision of the rectangular algorithm for a class of DC optimization problems (Q2141721) (← links)
- Deterministic global optimization of steam cycles using the IAPWS-IF97 model (Q2218882) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
- A parallel algorithm for partially separable non-convex global minimization: Linear constraints (Q2276880) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- A weighting method for 0-1 indefinite quadratic bilevel programming (Q2359528) (← links)
- Tabu search applied to the general fixed charge problem (Q2367015) (← links)
- Deterministic global optimization in ab-initio quantum chemistry (Q2392771) (← links)
- Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
- Global optimization of bounded factorable functions with discontinuities (Q2442640) (← links)
- Biconvex sets and optimization with biconvex functions: a survey and extensions (Q2465382) (← links)
- On the indefinite quadratic bilevel programming problem. (Q2477129) (← links)
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840) (← links)
- Mean-variance portfolio optimal problem under concave transaction cost (Q2490186) (← links)
- On solving nonconvex optimization problems by reducing the duality gap (Q2494287) (← links)
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities (Q2494476) (← links)
- Fractional programming with convex quadratic forms and functions (Q2496064) (← links)
- Global optimization of linear hybrid systems with explicit transitions (Q2503594) (← links)
- Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms (Q2542395) (← links)
- Discretizing dynamic programs (Q2553911) (← links)
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
- Optimization of a long-short portfolio under nonconvex transaction cost (Q2574062) (← links)
- Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs (Q2576446) (← links)
