Pages that link to "Item:Q4191855"
From MaRDI portal
The following pages link to Branch and Bound Methods for Mathematical Programming Systems (Q4191855):
Displaying 28 items.
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
- Branch and bound, integer, and non-integer programming (Q537592) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Implementations of special ordered sets in MP software (Q792884) (← links)
- Branch and bound with estimation based on pseudo-shadow-prices (Q805497) (← links)
- Integer-programming software systems (Q817202) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
- Global solution of optimization problems with signomial parts (Q924639) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- A possible way to reduce degeneracy in integer programming computations (Q1104240) (← links)
- A simplification for some disjunctive formulations (Q1104856) (← links)
- Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions (Q1153654) (← links)
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems (Q1255881) (← links)
- Solving integer programs with a few important binary gub constraints (Q1309895) (← links)
- Solving linear programming problems exactly (Q1354256) (← links)
- A hybrid approach to resolving a differentiable integer program. (Q1406652) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Representability of functions (Q1825755) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities (Q2240012) (← links)
- A note on modeling multiple choice requirements for simple mixed integer programming solvers (Q2563892) (← links)
- Mixed integer models for the stationary case of gas network optimization (Q2583142) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Production flow prototyping subject to imprecise activity specification (Q3451513) (← links)
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
- Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
- A branch-and-price approach for the maximum weight independent set problem (Q5717716) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
