Computing in Operations Research Using Julia
From MaRDI portal
Publication:3466770
DOI10.1287/ijoc.2014.0623zbMath1331.90001arXiv1312.1431OpenAlexW2105198154WikidataQ112777455 ScholiaQ112777455MaRDI QIDQ3466770
Publication date: 25 January 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1431
Nonlinear programming (90C30) Linear programming (90C05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Data-Driven Transit Network Design at Scale ⋮ Strong mixed-integer formulations for the floor layout problem ⋮ Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ \texttt{pyomo.dae}: a modeling and automatic discretization framework for optimization with differential and algebraic equations ⋮ Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ Extended Formulations in Mixed-Integer Convex Programming ⋮ Sequential Bounding Methods for Two-Stage Stochastic Programs ⋮ Discrete Wasserstein barycenters: optimal transport for discrete data ⋮ MathOptInterface: A Data Structure for Mathematical Optimization Problems ⋮ A distributionally ambiguous two-stage stochastic approach for investment in renewable generation ⋮ Soft robust solutions to possibilistic optimization problems ⋮ Extended formulations in mixed integer conic quadratic programming ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Optimal design of line replaceable units ⋮ Julia: A Fresh Approach to Numerical Computing ⋮ Random projections of linear and semidefinite problems with linear inequalities ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ Certifiably optimal sparse inverse covariance estimation ⋮ Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan ⋮ Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis ⋮ Travel Time Estimation in the Age of Big Data ⋮ Exact First-Choice Product Line Optimization ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ The \(K\)-server problem via a modern optimization lens ⋮ Sparse regression: scalable algorithms and empirical performance ⋮ Optimization of Tree Ensembles ⋮ ARCq: a new adaptive regularization by cubics ⋮ \(k\)-adaptive routing for the robust network loading problem ⋮ Multistage robust mixed-integer optimization under endogenous uncertainty ⋮ A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing ⋮ New solution approaches for the maximum-reliability stochastic network interdiction problem ⋮ Logistic regression: from art to science ⋮ Revisiting minimum profit conditions in uniform price day-ahead electricity auctions ⋮ A multi-stage stochastic optimization model of a pastoral dairy farm ⋮ JuMP: A Modeling Language for Mathematical Optimization ⋮ Optimal classification trees ⋮ Exponentially Accurate Temporal Decomposition for Long-Horizon Linear-Quadratic Dynamic Optimization ⋮ Algorithms and applications for a class of bilevel MILPs ⋮ Proximal Distance Algorithms: Theory and Examples ⋮ Measuring sample quality with diffusions ⋮ Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns ⋮ OR Forum—An Algorithmic Approach to Linear Regression ⋮ Exponentially convergent receding horizon strategy for constrained optimal control ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ Random Projections for Linear Programming ⋮ PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite ⋮ Robust and stochastic formulations for ambulance deployment and dispatch ⋮ Multistage Robust Mixed-Integer Optimization with Adaptive Partitions ⋮ Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds ⋮ Sparse classification: a scalable discrete optimization perspective ⋮ The Maximum Matrix Contraction Problem ⋮ Improving fairness in ambulance planning by time sharing ⋮ Sparse hierarchical regression with polynomials ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ A general ``power-of-\(d\) dispatching framework for heterogeneous systems ⋮ PETSc TSAdjoint: A Discrete Adjoint ODE Solver for First-Order and Second-Order Sensitivity Analysis
Uses Software
Cites Work
- Unnamed Item
- DrAmpl: A meta solver for optimization problem analysis
- Towards a practical parallelisation of the simplex method
- Hyper-sparsity in the revised simplex method and how to exploit it
- Branching and bounds tighteningtechniques for non-convex MINLP
- Solving Real-World Linear Programs: A Decade and More of Progress
- Sparse matrix test problems
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- Pivot selection methods of the Devex LP code
