Pages that link to "Item:Q378129"

The following pages link to An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129):

Displaying 11 items.

• Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
• Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
• A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
• Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
• Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
• On the tightness of an LP relaxation for rational optimization and its applications (Q1755822) (← links)
• A vector linear programming approach for certain global optimization problems (Q1756780) (← links)
• Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
• Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)