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.
- Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
- Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble (Q709664) (← links)
- The zone hopping problem (Q750298) (← links)
- Approximate algorithms for the Knapsack problem on parallel computers (Q757041) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- Completeness in approximation classes (Q811119) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Single-vendor multi-buyer inventory coordination under private information (Q933523) (← links)
- Scheduling vessels and container-yard operations with conflicting objectives (Q940925) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Partitioning graphs of supply and demand (Q967306) (← links)
- Playing monotone games to understand learning behaviors (Q974103) (← links)
- Exponential-time approximation of weighted set cover (Q989538) (← links)
- A note on graph balancing problems with restrictions (Q990093) (← links)
- Approximability of partitioning graphs with supply and demand (Q1002107) (← links)
- FPTAS for half-products minimization with scheduling applications (Q1005250) (← links)
- Approximated consistency for the automatic recording constraint (Q1010285) (← links)
- Approximate solution of the control problem of supplies with many intervals and concave cost functions (Q1015342) (← links)
- Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- Scheduling three chains on two parallel machines (Q1040986) (← links)
- Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
- An asymptotically exact polynomial algorithm for equipartition problems (Q1076607) (← links)
- On different approximation criteria for subset product problems (Q1076608) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- Ratio combinatorial programs (Q1130080) (← links)
- Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Fast approximation algorithm for job sequencing with deadlines (Q1154384) (← links)
- General approximation algorithms for some arithmetical combinatorial problems (Q1158970) (← links)
- A fully polynomial approximation algorithm for the 0-1 knapsack problem (Q1159134) (← links)
- Bin packing can be solved within 1+epsilon in linear time (Q1164429) (← links)
- A heuristic method for the design of minimum weight trusses using discrete member sizes (Q1165072) (← links)
- Embedding decision-analytic control in a learning architecture (Q1182163) (← links)
- A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem (Q1198054) (← links)
- A total-value greedy heuristic for the integer knapsack problem (Q1200766) (← links)