Pages that link to "Item:Q2381527"

The following pages link to Approximation schemes for a class of subset selection problems (Q2381527):

Displaying 16 items.

• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
• Inverse 1-median problem on trees under weighted Hamming distance (Q445338) (← links)
• Inverse median location problems with variable coordinates (Q623783) (← links)
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
• Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
• A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
• Online multistage subset maximization problems (Q2041973) (← links)
• Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
• Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
• The knapsack problem with special neighbor constraints (Q2123119) (← links)
• Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
• Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
• Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
• Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
• (Q5075745) (← links)
• Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)