A brief history of linear and mixed-integer programming computation
From MaRDI portal
Publication:1946013
Cited in
(57)- Optimization methods for petroleum fields development and production systems: a review
- Examining military medical evacuation dispatching policies utilizing a Markov decision process model of a controlled queueing system
- Staff assignment with lexicographically ordered acceptance levels
- Outer approximation for integer nonlinear programs via decision diagrams
- Lossless convexification of optimal control problems with annular control constraints
- A survey of scheduling with parallel batch (p-batch) processing
- Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Split cuts from sparse disjunctions
- Generation techniques for linear programming instances with controllable properties
- Circular economy implementation in waste management network design problem: a case study
- Leveraged least trimmed absolute deviations
- Certifiably optimal sparse principal component analysis
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- OR forum: An algorithmic approach to linear regression
- Best subset selection via a modern optimization lens
- Sparse Convex Regression
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Outlier detection in time series via mixed-integer conic quadratic optimization
- scientific article; zbMATH DE number 7387624 (Why is no real title available?)
- A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX®
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies
- Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy
- Mixed-integer convex representability
- Template-Based Minor Embedding for Adiabatic Quantum Optimization
- Decomposition Branching for Mixed Integer Programming
- Online Mixed-Integer Optimization in Milliseconds
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- A friendly smoothed analysis of the simplex method
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- Learning in combinatorial optimization: what and how to explore
- Optimization in liner shipping
- Optimal classification trees
- Optimization in liner shipping
- Grouped variable selection with discrete optimization: computational and statistical perspectives
- Margin optimal classification trees
- Large Sample Properties of Matching for Balance
- Complexity of optimizing over the integers
- On optimal regression trees to detect critical intervals for multivariate functional data
- Decomposition methods for global solution of mixed-integer linear programs
- Loss-optimal classification trees: a generalized framework and the logistic case
- An integer programming algorithm for constructing maximin distance designs from good lattice point sets
- A practical approach for dealing with hard knapsack problems using general-purpose integer programming software
- Exponential lower bounds for many pivot rules for the simplex method
- Enhancing crop strategies with linear programming: leveraging historical constraint for optimal decision-making
- Jacques Benders and his decomposition algorithm
- Maximum number of power unit state changes in selecting the composition of equipment
- Last fifty years of integer linear programming: a focus on recent practical advances
- Rank-one convexification for sparse regression
- Interpretable optimisation-based approach for hyper-box classification
- Satisfiability modulo theories for verifying MILP certificates
- Computational aspects of lifted cover inequalities for knapsacks with few different weights
- Certifiably optimal direction estimation in sparse single-index model
- Mathematical optimization in classification and regression trees
- Integer programming for the generalized high school timetabling problem
Describes a project that uses
Uses Software
This page was built for publication: A brief history of linear and mixed-integer programming computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946013)
