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.
- Dual toll pricing for hazardous materials transport with linear delay (Q262911) (← links)
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Cold supply chain design with environmental considerations: a simulation-optimization approach (Q322665) (← links)
- A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies (Q427360) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision (Q721144) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- The cluster problem revisited (Q742132) (← links)
- On the convexification of nonlinear programming problems: An applications-oriented survey (Q799590) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Interval branch and bound with local sampling for constrained global optimization (Q811876) (← links)
- Proof of convergence for a global optimization algorithm for problems with ordinary differential equations (Q811878) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)
- Robust network design in telecommunications under polytope demand uncertainty (Q976502) (← links)
- On the nonlinear multilevel programming problems (Q998684) (← links)
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (Q1067978) (← links)
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques (Q1069447) (← links)
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
- On some optimization problems under uncertainty (Q1094334) (← links)
- On consistency of bounding operations in deterministic global optimization (Q1101343) (← links)
- Second-order sensitivity analysis in factorable programming: Theory and applications (Q1104867) (← links)
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
- Reversed geometric programming: A branch-and-bound method involving linear subproblems (Q1141082) (← links)
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems (Q1149236) (← links)
- Algorithms for parametric nonconvex programming (Q1158344) (← links)
- Membership functions, some mathematical programming models and production scheduling (Q1165156) (← links)
- LP-form inclusion functions for global optimization (Q1174536) (← links)
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms (Q1177911) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
- Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
- Generalized bilinear programming. I: Models, applications and linear programming relaxation (Q1199512) (← links)
- Global search algorithms for minimum concave-cost network flow problems (Q1200522) (← links)
- Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
- Linear multiplicative programming (Q1207311) (← links)
- Discrete solutions to engineering design problems (Q1213829) (← links)
- An exact algorithm for the concave transportation problem (Q1233394) (← links)
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems (Q1255881) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Solving the staircase cost facility location problem with decomposition and piecewise linearization (Q1333508) (← links)
- Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem (Q1338542) (← links)
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224) (← links)
