On the Significance of Solving Linear Programming Problems with Some Integer Variables
From MaRDI portal
Cited in
(58)- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- Piecewise linear trees as surrogate models for system design and planning under high-frequency temporal variability
- A survey of the operational use of ILP models
- Mathematical programming models and exact algorithms
- Parametric formulation of the general integer linear programming problem
- A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design
- Introduction to QUBO
- Gemischt ganzzahlige lineare Programme zur Lösung gewisser Entscheidungsprobleme
- Multi-market portfolio optimization with conditional value at risk
- Partitioning procedures for solving mixed-variables programming problems
- George Dantzig's contributions to integer programming
- 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
- Variable speed in vertical flight planning
- Integer programming for urban design
- George B. Dantzig: a legendary life in mathematical programming
- Integer programming formulation of combinatorial optimization problems
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- MIP relaxations in factorable programming
- CLOUD computing risk management for server-farm repair rates, consumer load cycle, server-farm repair crew count, and additional servers
- Models and solution techniques for production planning problems with increasing byproducts
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Algorithmic cost allocation games: theory and applications
- Mathematical programming techniques in water network optimization
- Incremental and encoding formulations for mixed integer programming
- A unified formulation of the machine scheduling problem
- Comments on ``enhancements on the hyperplanes arrangements in mixed-integer programming techniques
- scientific article; zbMATH DE number 3181654 (Why is no real title available?)
- A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Mixed integer linear programming formulation techniques
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- Supervised homogeneity fusion: a combinatorial approach
- Reduction of nonlinear integer separable programming problems∗
- Post-pruning in decision tree induction using multiple performance measures
- On two-point boundary conditions in optimal control problems
- Optimizing drinking water distribution system operations
- Branch-and-cut for complementarity-constrained optimization
- Locally ideal formulations for piecewise linear functions with indicator variables
- Models for representing piecewise linear cost functions
- Exact computation of max weighted score estimators
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization
- Compact mixed-integer programming formulations in quadratic optimization
- Mathematical programming formulations for piecewise polynomial functions
- Exact and approximation algorithms for a soft rectangle packing problem
- Implementations of special ordered sets in MP software
- Combined route capacity and route length models for unit demand vehicle routing problems
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
- Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben
- (Global) optimization: historical notes and recent developments
- Data-driven modeling of \(\mathrm{CO}_2\) emission-allowance compensation for wood-purchasing optimization toward carbon-neutral forest industry
- Capital Budgeting in a Multiple Objective Environment
- George Dantzig's impact on the theory of computation
- Polarity and the complexity of the shooting experiment
This page was built for publication: On the Significance of Solving Linear Programming Problems with Some Integer Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3262683)
