Branch-and-bound algorithms as polynomial-time approximation schemes
From MaRDI portal
Cites work
- A Branch Search Algorithm for the Knapsack Problem
- A linear time approximation scheme for the single machine scheduling problem with controllable processing times
- A theoretical and computational analysis of full strong-branching
- Algorithms and Computation
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Basis reduction and the complexity of branch-and-bound
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Branch-and-bound solves random binary IPs in poly(n)-time
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Computing Partitions with Applications to the Knapsack Problem
- Discrete-variable extremum problems
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Grouping techniques for scheduling problems: simpler and faster
- Hard Knapsack Problems
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1783886 (Why is no real title available?)
- Hybrid rounding techniques for knapsack problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
This page was built for publication: Branch-and-bound algorithms as polynomial-time approximation schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363155)
