Pages that link to "Item:Q4114965"
From MaRDI portal
The following pages link to Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems (Q4114965):
Displayed 50 items.
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks (Q2402675) (← links)
- Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- Scheduling two-stage jobs on multiple flowshops (Q2419124) (← links)
- Equivalence of some different maintenance activities in single-machine scheduling (Q2422132) (← links)
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs (Q2427693) (← links)
- Scheduling of pipelined operator graphs (Q2434287) (← links)
- Job-shop scheduling in a body shop (Q2434313) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Simple FPTAS for the subset-sums ratio problem (Q2445243) (← links)
- Bin covering with cardinality constraints (Q2446840) (← links)
- Online removable knapsack problem under convex function (Q2453163) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Algorithms for the bounded set-up knapsack problem (Q2467131) (← links)
- Scheduling a two-stage flowshop under makespan constraint (Q2476691) (← links)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- Hybrid rounding techniques for knapsack problems (Q2489957) (← links)
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem (Q2503277) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244) (← links)
- Efficiently computing succinct trade-off curves (Q2581275) (← links)
- The Prize-collecting Call Control Problem on Weighted Lines and Rings (Q2798111) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- A Dynamic Programming Approach for a Class of Robust Optimization Problems (Q2817842) (← links)
- Two Dimensional Knapsack with Unloading Constraints (Q2840720) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- Algorithms with guarantee value for knapsack problems (Q2903135) (← links)
- DIAMETER-CONSTRAINED STEINER TREES (Q2905280) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS (Q2920364) (← links)
- Optimal Allocation for Chunked-Reward Advertising (Q2937765) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
- The Unbounded Knapsack Problem (Q2971610) (← links)
- ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← links)
- 2D Knapsack: Packing Squares (Q3004667) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Worst-case analysis of greedy algorithms for the subset-sum problem (Q3042877) (← links)
- Coupled-Tasks in Presence of Bipartite Compatibilities Graphs (Q3195325) (← links)
- Rational solutions of the graphsack problem (Q3315278) (← links)
- The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (Q3354469) (← links)
- Primal-Dual Algorithms for Precedence Constrained Covering Problems (Q3453300) (← links)
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- Complexity of some parametric integer and network programming problems (Q3712126) (← links)