Pages that link to "Item:Q1102872"
From MaRDI portal
The following pages link to On finding new vertices and redundant constraints in cutting plane algorithms for global optimization (Q1102872):
Displaying 41 items.
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type (Q685859) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning (Q953293) (← links)
- Bisecton by global optimization revisited (Q965055) (← links)
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← links)
- On the minimization of a quasi-concave function subject to linear constraints (Q1178718) (← links)
- On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
- An algorithm for indefinite quadratic programming with convex constraints (Q1180839) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure (Q1184354) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
- The complementary convex structure in global optimization (Q1187368) (← links)
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization (Q1187370) (← links)
- A global optimization approach for solving the convex multiplicative programming problem (Q1200524) (← links)
- Polyhedral annexation, dualization and dimension reduction technique in global optimization (Q1200635) (← links)
- A global optimization approach for the linear two-level program (Q1207038) (← links)
- An algorithm for a concave production cost network flow problem (Q1301576) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- A quasiconcave minimization method for solving linear two-level programs (Q1318264) (← links)
- An algorithm for solving general D. C. programming problems (Q1332952) (← links)
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
- A partial cooperation model for non-unique linear two-level decision problems (Q1600980) (← links)
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
- An exact solution method for reliability optimization in complex systems (Q1772968) (← links)
- Convex minimization under Lipschitz constraints (Q1823144) (← links)
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
- Decomposition approach for the global minimization of biconcave functions over polytopes (Q1918288) (← links)
- Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← links)
- DC programming: overview. (Q1969457) (← links)
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem (Q1971990) (← links)
- Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
- D.c sets, d.c. functions and nonlinear equations (Q2367918) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- A decomposition method for the min concave cost flow problem with a staircase structure (Q3471825) (← links)
- A modified version of Tuy's method for solving d.c. programing problem (Q3813618) (← links)
- An efficient solution method for rank two quasiconcave minimization problems (Q4327903) (← links)
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS (Q4548050) (← links)
- (Q4963438) (← links)