Pages that link to "Item:Q623370"

The following pages link to An FPTAS for minimizing the product of two non-negative linear cost functions (Q623370):

Displaying 17 items.

• An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
• Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
• Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
• A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
• A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
• An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set (Q1949686) (← links)
• Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
• Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
• Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
• Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
• Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
• The Rank-One Quadratic Assignment Problem (Q5085471) (← links)
• Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
• An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation (Q6552696) (← links)