Pages that link to "Item:Q2276877"

The following pages link to A note on adapting methods for continuous global optimization to the discrete case (Q2276877):

Displaying 14 items.

• A hybrid method for quantum global optimization (Q427367) (← links)
• Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
• A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
• Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442) (← links)
• Generalized bilinear programming. I: Models, applications and linear programming relaxation (Q1199512) (← links)
• Capacity planning in manufacturing and computer networks (Q1278227) (← links)
• Nonlinear programming for multiperiod capacity planning in a manufacturing system (Q1278476) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223) (← links)
• Capacity planning in networks of queues with manufacturing applications (Q1900269) (← links)
• A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
• An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)