Pages that link to "Item:Q1180822"

The following pages link to On-line and off-line vertex enumeration by adjacency lists (Q1180822):

Displaying 31 items.

• A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
• An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
• Piece adding technique for convex maximization problems (Q604949) (← links)
• An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
• Inverse eigenvalue problems for linear complementarity systems (Q716414) (← links)
• A convex analysis approach for convex multiplicative programming (Q934807) (← 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)
• Approximating the nondominated set of an MOLP by approximately solving its dual problem (Q999127) (← links)
• A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
• Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization (Q1187370) (← links)
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
• Constraint decomposition algorithms in global optimization (Q1342897) (← links)
• Errors bounds for finite approximations of coherent lower previsions on finite probability spaces (Q1726342) (← links)
• An exact solution method for reliability optimization in complex systems (Q1772968) (← links)
• Conical partition algorithm for maximizing the sum of dc ratios (Q1781967) (← links)
• Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← 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)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← 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)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
• An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
• A new duality approach to solving concave vector maximization problems (Q2433928) (← links)
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
• Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
• (Q4266762) (← links)
• MULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDS (Q4736352) (← links)
• Efficient algorithms for solving nonlinear fractional programming problems (Q5080834) (← links)