Pages that link to "Item:Q4770206"
From MaRDI portal
The following pages link to Trivial integer programs unsolvable by branch-and-bound (Q4770206):
Displayed 15 items.
- 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)
- Approach to decision making in fuzzy environment (Q1962990) (← 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)
- Complexity and computability of solutions to linear programming systems (Q3898028) (← links)
- Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
- (Q5708518) (← links)