DOI10.1016/S0167-5060(08)70351-0zbMath0405.90049OpenAlexW1577278402MaRDI QIDQ4191855
E. M. L. Beale
Publication date: 1979
Published in: Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70351-0
Representability in mixed integer programming. I: Characterization results,
Algorithms and Software for Convex Mixed Integer Nonlinear Programs,
Production flow prototyping subject to imprecise activity specification,
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems,
Solving linear programming problems exactly,
A possible way to reduce degeneracy in integer programming computations,
A simplification for some disjunctive formulations,
Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information, Multivariable Branching: A 0-1 Knapsack Problem Case Study, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables, A hybrid approach to resolving a differentiable integer program., Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions, Global solution of optimization problems with signomial parts, The multidimensional 0-1 knapsack problem: an overview., Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities, A branch-and-price approach for the maximum weight independent set problem, Branch and bound, integer, and non-integer programming, SCIP: solving constraint integer programs, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm, Representability of functions, A note on modeling multiple choice requirements for simple mixed integer programming solvers, Implementations of special ordered sets in MP software, Solving integer programs with a few important binary gub constraints, Mixed integer models for the stationary case of gas network optimization, Branch and bound with estimation based on pseudo-shadow-prices, Integer-programming software systems
