Trivial integer programs unsolvable by branch-and-bound
From MaRDI portal
Cites work
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- A tree-search algorithm for mixed integer programming problems
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Algorithm for the Traveling Salesman Problem
- An Automatic Method of Solving Discrete Programming Problems
- Discrete Programming by the Filter Method
- Experiments in mixed-integer linear programming
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3523329 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- On algorithms for discrete problems
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- The complexity of theorem-proving procedures
- The simplex algorithm with the pivot rule of maximizing criterion improvement
Cited in
(37)- Representability in mixed integer programming. I: Characterization results
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- A note on duality in disjunctive programming
- A converse for disjunctive constraints
- The value function of a mixed integer program. II
- A general approach to solving a wide class of fuzzy optimization problems
- An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
- Thinner is not always better: cascade knapsack problems
- How important are branching decisions: fooling MIP solvers
- Approach to decision making in fuzzy environment
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem
- On the complexity of finding shortest variable disjunction branch-and-bound proofs
- Modified orbital branching for structured symmetry with an application to unit commitment
- Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems
- Algorithms of discrete optimization and their application to problems with fuzzy coefficients
- Simple lifted cover inequalities and hard knapsack problems
- Lower bounds on the size of general branch-and-bound trees
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- Complexity and computability of solutions to linear programming systems
- Polyhedral annexation in mixed integer and combinatorial programming
- Estimation of the number of iterations in integer programming algorithms using the regular partitions method
- scientific article; zbMATH DE number 2230226 (Why is no real title available?)
- Branch-and-bound solves random binary IPs in poly(n)-time
- Compressing branch-and-bound trees
- A theoretical and computational analysis of full strong-branching
- Complexity of optimizing over the integers
- Yet harder knapsack problems
- Finding near optimal solutions to the thesis defense timetabling problem by exploiting symmetries
- On computing small variable disjunction branch-and-bound trees
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Compressing branch-and-bound trees
- Learning to branch: generalization guarantees and limits of data-independent discretization
- Branching with a pre-specified finite list of k-sparse split sets for binary MIPs
- Page cuts for integer interval linear programming
- Column basis reduction and decomposable knapsack problems
- Bounds on the size of branch-and-bound proofs for integer knapsacks
This page was built for publication: Trivial integer programs unsolvable by branch-and-bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4770206)
