scientific article
From MaRDI portal
Publication:3372341
zbMath1137.90622MaRDI QIDQ3372341
Jeffrey T. Linderoth, Ted K. Ralphs
Publication date: 20 February 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Integer programming techniques for the nurse rostering problem, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Recursive central rounding for mixed integer programs, OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms, Cover by disjoint cliques cuts for the knapsack problem with conflicting items, Efficient separation of RLT cuts for implicit and explicit bilinear products, Оптимизация загрузки упорядоченной совокупности летательных аппаратов, Faster integer-feasibility in mixed-integer linear programs by branching to force change, An interior point cutting plane heuristic for mixed integer programming, Experiments with conflict analysis in mixed integer programming, Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming, Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts, SCIP: solving constraint integer programs, A hybrid branch-and-bound approach for exact rational mixed-integer programming, Convex mixed integer nonlinear programming problems and an outer approximation algorithm, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Conflict-Driven Heuristics for Mixed Integer Programming
Uses Software
