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.
- 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)
- Approximate algorithms for some generalized knapsack problems (Q1238705) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- Approximation algorithms for the capacitated plant allocation problem (Q1332940) (← links)
- Joint performance of greedy heuristics for the integer knapsack problem (Q1343153) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453) (← links)
- On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
- Approximation algorithms and relaxations for a service provision problem on a telecommunication network (Q1399109) (← links)
- Complexity and approximability results for slicing floorplan designs. (Q1399599) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- A PTAS for weight constrained Steiner trees in series--parallel graphs. (Q1401399) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- On the two-dimensional knapsack problem (Q1433651) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
- Optimizing a mail-order with discount and shipping costs (Q1603552) (← links)
- Efficient approximation algorithms for the subset-sums equality problem. (Q1608313) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- Ranking robustness and its application to evacuation planning (Q1681390) (← links)
- Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
- Greedy algorithms for the single-demand facility location problem (Q1728306) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- A universally-truthful approximation scheme for multi-unit auctions (Q1735729) (← links)
- Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- Approximation of the supply scheduling problem (Q1779701) (← links)
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249) (← links)
- On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space (Q1785373) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Stochastic on-line knapsack problems (Q1804369) (← links)
- Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. (Q1811628) (← links)