Pages that link to "Item:Q5181531"

The following pages link to The Generalized Lattice-Point Problem (Q5181531):

Displaying 18 items.

• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
• A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← links)
• A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
• A simplex procedure for linear programs with some 0-1 integer constraints (Q1160561) (← links)
• Membership functions, some mathematical programming models and production scheduling (Q1165156) (← links)
• A finite algorithm for solving the generalized lattice point problem (Q1179205) (← links)
• Quasi-concave minimization subject to linear constraints (Q1215459) (← links)
• Improved convexity cuts for lattice point problems (Q1218339) (← links)
• Disjunctive programming: Properties of the convex hull of feasible points (Q1281382) (← links)
• Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← links)
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
• Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
• Polyhedral convexity cuts and negative edge extensions (Q4777060) (← links)
• Introduction to QUBO (Q5050141) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
• Cut search methods in integer programming (Q5661707) (← links)