Pages that link to "Item:Q3705227"

The following pages link to A finite algorithm for concave minimization over a polyhedron (Q3705227):

Displaying 20 items.

• A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
• An algorithm for optimizing over the weakly-efficient set (Q1077330) (← 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)
• Using convex envelopes to solve the interactive fixed-charge linear programming problem (Q1093525) (← links)
• On the structure and properties of a linear multilevel programming problem (Q1095807) (← links)
• A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• Discontinuous piecewise linear optimization (Q1380942) (← links)
• Subdivision of simplices relative to a cutting plane and finite concave minimization (Q1817320) (← links)
• Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
• Solving polyhedral d.c. optimization problems via concave minimization (Q2200081) (← links)
• A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation (Q2505552) (← links)
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925735) (← links)
• Reverse polyblock approximation for optimization over the weakly efficient set and efficient set. (Q5942841) (← links)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)