Pages that link to "Item:Q4168785"

The following pages link to Combinatorial Problems: Reductibility and Approximation (Q4168785):

Displaying 23 items.

• Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← links)
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
• Approximate algorithms for the Knapsack problem on parallel computers (Q757041) (← links)
• Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Approximations to clustering and subgraph problems on trees (Q1056227) (← links)
• Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
• Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
• The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
• Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
• Discrete extremal problems (Q1152306) (← links)
• Bin packing can be solved within 1+epsilon in linear time (Q1164429) (← links)
• Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
• Single machine scheduling with batch deliveries (Q1278307) (← links)
• List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
• A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) (Q1376266) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• Knapsack problem with objective value gaps (Q2361124) (← links)
• On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks (Q2402675) (← links)
• Improving the solution complexity of the scheduling problem with deadlines: A general technique (Q2954334) (← links)
• Bewertung heuristischer Methoden (Q3941214) (← links)
• Approximation algorithms for combinatorial fractional programming problems (Q4726063) (← links)
• Integer knapsack problems with profit functions of the same value range (Q6054010) (← links)