A brief history of linear and mixed-integer programming computation

From MaRDI portal
Revision as of 16:09, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1946013

zbMath1270.90003MaRDI QIDQ1946013

Robert E. Bixby

Publication date: 17 April 2013

Published in: Documenta Mathematica (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/DMJDMV/vol-ismp/25_bixby-robert.html




Related Items (43)

Best subset selection via a modern optimization lensMathematical optimization in classification and regression treesA 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 InferenceOptimization methods for petroleum fields development and production systems: a reviewBuilding Representative Matched Samples With Multi-Valued Treatments in Large Observational StudiesInterior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation TherapyMixed-Integer Convex RepresentabilityTemplate-Based Minor Embedding for Adiabatic Quantum OptimizationSparse high-dimensional regression: exact scalable algorithms and phase transitionsDecomposition Branching for Mixed Integer ProgrammingGrouped variable selection with discrete optimization: computational and statistical perspectivesMargin optimal classification treesInteger programming for the generalized high school timetabling problemLarge Sample Properties of Matching for BalanceOnline Mixed-Integer Optimization in MillisecondsSplit cuts from sparse disjunctionsComplexity of optimizing over the integersOn optimal regression trees to detect critical intervals for multivariate functional dataUnnamed ItemSolving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value FunctionA Friendly Smoothed Analysis of the Simplex MethodDeletion Presolve for Accelerating Infeasibility Diagnosis in Optimization ModelsGeneration techniques for linear programming instances with controllable propertiesOptimization in liner shippingExamining military medical evacuation dispatching policies utilizing a Markov decision process model of a controlled queueing systemCircular economy implementation in waste management network design problem: a case studyLearning in Combinatorial Optimization: What and How to ExploreStaff assignment with lexicographically ordered acceptance levelsLeveraged least trimmed absolute deviationsOptimization in liner shippingOuter approximation for integer nonlinear programs via decision diagramsOptimal classification treesOR Forum—An Algorithmic Approach to Linear RegressionCertifiably optimal sparse principal component analysisStructure-driven fix-and-propagate heuristics for mixed integer programmingLossless convexification of optimal control problems with annular control constraintsA survey of scheduling with parallel batch (p-batch) processingSparse Convex RegressionDecision Diagram Decomposition for Quadratically Constrained Binary OptimizationOutlier Detection in Time Series via Mixed-Integer Conic Quadratic OptimizationConstructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithmsOpportunities for reinforcement learning in stochastic dynamic vehicle routing


Uses Software





This page was built for publication: A brief history of linear and mixed-integer programming computation