On the Significance of Solving Linear Programming Problems with Some Integer Variables

Related Items

COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben, Exact computation of max weighted score estimators, Introduction to QUBO, Mathematical Programming Models and Exact Algorithms, Mathematical programming techniques in water network optimization, Unnamed Item, Exact and approximation algorithms for a soft rectangle packing problem, Parametric formulation of the general integer linear programming problem, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, Post-pruning in decision tree induction using multiple performance measures, Partitioning procedures for solving mixed-variables programming problems, Multi-market portfolio optimization with conditional value at risk, Mathematical programming formulations for piecewise polynomial functions, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, (Global) optimization: historical notes and recent developments, Supervised homogeneity fusion: a combinatorial approach, A systematic extreme point enumeration procedure for fixed charge problem, Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints, On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations, Comments on ``enhancements on the hyperplanes arrangements in mixed-integer programming techniques, Gemischt ganzzahlige lineare Programme zur Lösung gewisser Entscheidungsprobleme, Locally ideal formulations for piecewise linear functions with indicator variables, Incremental and encoding formulations for mixed integer programming, Models for representing piecewise linear cost functions, Reduction of nonlinear integer separable programming problems^∗, Branch-and-cut for complementarity-constrained optimization, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, George Dantzig's contributions to integer programming, George Dantzig's impact on the theory of computation, Combined route capacity and route length models for unit demand vehicle routing problems, Polarity and the complexity of the shooting experiment, Models and solution techniques for production planning problems with increasing byproducts, Integer programming for urban design, A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization, A survey of the operational use of ILP models, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Capital Budgeting in a Multiple Objective Environment, On two-point boundary conditions in optimal control problems, Algorithmic Cost Allocation Games: Theory and Applications, Integer programming formulation of combinatorial optimization problems, A unified formulation of the machine scheduling problem, Variable Speed in Vertical Flight Planning, Mixed Integer Linear Programming Formulation Techniques, An effective logarithmic formulation for piecewise linearization requiring no inequality constraint, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, Optimizing drinking water distribution system operations, Compact mixed-integer programming formulations in quadratic optimization, Implementations of special ordered sets in MP software, Data-driven modeling of \(\mathrm{CO}_2\) emission-allowance compensation for wood-purchasing optimization toward carbon-neutral forest industry, George B. Dantzig: a legendary life in mathematical programming, A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design