Pages that link to "Item:Q3466770"
From MaRDI portal
The following pages link to Computing in Operations Research Using Julia (Q3466770):
Displaying 50 items.
- Discrete Wasserstein barycenters: optimal transport for discrete data (Q343818) (← links)
- Sparse hierarchical regression with polynomials (Q782451) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- \texttt{pyomo.dae}: a modeling and automatic discretization framework for optimization with differential and algebraic equations (Q1621687) (← links)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
- Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
- Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan (Q1711478) (← links)
- The \(K\)-server problem via a modern optimization lens (Q1728474) (← links)
- \(k\)-adaptive routing for the robust network loading problem (Q1742208) (← links)
- Logistic regression: from art to science (Q1750250) (← links)
- Revisiting minimum profit conditions in uniform price day-ahead electricity auctions (Q1754186) (← links)
- A multi-stage stochastic optimization model of a pastoral dairy farm (Q1755408) (← links)
- New solution approaches for the maximum-reliability stochastic network interdiction problem (Q1989731) (← links)
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
- Sparse classification: a scalable discrete optimization perspective (Q2071494) (← links)
- A general ``power-of-\(d\)'' dispatching framework for heterogeneous systems (Q2095043) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- Certifiably optimal sparse inverse covariance estimation (Q2205987) (← links)
- Sparse regression: scalable algorithms and empirical performance (Q2225311) (← links)
- Multistage robust mixed-integer optimization under endogenous uncertainty (Q2239983) (← links)
- A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing (Q2242251) (← links)
- Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
- Measuring sample quality with diffusions (Q2286455) (← links)
- Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns (Q2288946) (← links)
- Exponentially convergent receding horizon strategy for constrained optimal control (Q2296253) (← links)
- Robust and stochastic formulations for ambulance deployment and dispatch (Q2312348) (← links)
- Improving fairness in ambulance planning by time sharing (Q2327642) (← links)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
- Random projections of linear and semidefinite problems with linear inequalities (Q2689146) (← links)
- OR Forum—An Algorithmic Approach to Linear Regression (Q2806052) (← links)
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite (Q2819234) (← links)
- Multistage Robust Mixed-Integer Optimization with Adaptive Partitions (Q2830769) (← links)
- Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds (Q2830953) (← links)
- The Maximum Matrix Contraction Problem (Q2835698) (← links)
- Julia: A Fresh Approach to Numerical Computing (Q2960399) (← links)
- Extended Formulations in Mixed-Integer Convex Programming (Q3186495) (← links)
- Sequential Bounding Methods for Two-Stage Stochastic Programs (Q3186665) (← links)
- ARC<sub>q</sub>: a new adaptive regularization by cubics (Q4638924) (← links)
- Exponentially Accurate Temporal Decomposition for Long-Horizon Linear-Quadratic Dynamic Optimization (Q4687231) (← links)
- PETSc TSAdjoint: A Discrete Adjoint ODE Solver for First-Order and Second-Order Sensitivity Analysis (Q5022486) (← links)
- Data-Driven Transit Network Design at Scale (Q5031609) (← links)
- MathOptInterface: A Data Structure for Mathematical Optimization Problems (Q5085984) (← links)
- Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis (Q5126603) (← links)
- Travel Time Estimation in the Age of Big Data (Q5126617) (← links)
- Exact First-Choice Product Line Optimization (Q5126626) (← links)
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) (← links)
- Optimization of Tree Ensembles (Q5144785) (← links)
- Random Projections for Linear Programming (Q5219688) (← links)
- Proximal Distance Algorithms: Theory and Examples (Q5381120) (← links)
