Pages that link to "Item:Q4770206"

The following pages link to Trivial integer programs unsolvable by branch-and-bound (Q4770206):

Displaying 30 items.

• Estimation of the number of iterations in integer programming algorithms using the regular partitions method (Q463771) (← links)
• Yet harder knapsack problems (Q653327) (← links)
• Page cuts for integer interval linear programming (Q754756) (← links)
• Column basis reduction and decomposable knapsack problems (Q834182) (← links)
• Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
• Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems (Q1110993) (← links)
• A note on duality in disjunctive programming (Q1229803) (← links)
• A converse for disjunctive constraints (Q1238749) (← links)
• The value function of a mixed integer program. II (Q1258688) (← links)
• A general approach to solving a wide class of fuzzy optimization problems (Q1296847) (← links)
• An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools (Q1686513) (← links)
• Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
• How important are branching decisions: fooling MIP solvers (Q1785358) (← links)
• Approach to decision making in fuzzy environment (Q1962990) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
• Lower bound on size of branch-and-bound trees for solving lot-sizing problem (Q2083992) (← links)
• On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
• Modified orbital branching for structured symmetry with an application to unit commitment (Q2340280) (← links)
• Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688) (← links)
• Algorithms of discrete optimization and their application to problems with fuzzy coefficients (Q2509222) (← links)
• Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
• Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
• Complexity and computability of solutions to linear programming systems (Q3898028) (← links)
• Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
• (Q5708518) (← links)
• Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
• A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)