Trivial integer programs unsolvable by branch-and-bound
From MaRDI portal
Publication:4770206
DOI10.1007/BF01580225zbMath0283.90035OpenAlexW2060042885MaRDI QIDQ4770206
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580225
Related Items
Column basis reduction and decomposable knapsack problems, Representability in mixed integer programming. I: Characterization results, A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems, On the complexity of finding shortest variable disjunction branch-and-bound proofs, Branch-and-bound solves random binary IPs in poly\((n)\)-time, An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools, Compressing branch-and-bound trees, A theoretical and computational analysis of full strong-branching, Complexity of optimizing over the integers, Lower bounds on the size of general branch-and-bound trees, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems, Approach to decision making in fuzzy environment, Estimation of the number of iterations in integer programming algorithms using the regular partitions method, Bounds on the size of branch-and-bound proofs for integer knapsacks, Yet harder knapsack problems, Thinner is not always better: cascade knapsack problems, Polyhedral annexation in mixed integer and combinatorial programming, A note on duality in disjunctive programming, How important are branching decisions: fooling MIP solvers, A converse for disjunctive constraints, Algorithms of discrete optimization and their application to problems with fuzzy coefficients, The value function of a mixed integer program. II, Complexity and computability of solutions to linear programming systems, Page cuts for integer interval linear programming, Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II, Unnamed Item, Lower bound on size of branch-and-bound trees for solving lot-sizing problem, A general approach to solving a wide class of fuzzy optimization problems, Modified orbital branching for structured symmetry with an application to unit commitment, Simple lifted cover inequalities and hard knapsack problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On algorithms for discrete problems
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- An Automatic Method of Solving Discrete Programming Problems
- Discrete Programming by the Filter Method
- A tree-search algorithm for mixed integer programming problems
- An Algorithm for the Traveling Salesman Problem
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- Experiments in mixed-integer linear programming
- The complexity of theorem-proving procedures
