Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

CHANGE ME

Published: 2018/11/18, Updated: 2019/11/01
  • Bernard Knueven
  • James Ostrowski
  • Jean-Paul Watson
  • Categories Applications - OR and Management Sciences Tags mathematical programming formulations, mixed-integer programming, unit commitment Short URL: https://optimization-online.org/?p=15513

    Citation

    Department of Industrial and Systems Engineering University of Tennessee, Knoxville, TN 37996 November 2018

    Article

    Download

    View CHANGE ME

    Post navigation
    On the complexity of solving feasibility problems
    A branch and price algorithm for the resource constrained home health care vehicle routing problem
    Log in


    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers approximation algorithms augmented lagrangian method bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity compressed sensing conic optimization convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

    © 2023 Optimization Online • Child Theme of GeneratePress
    For feedback or questions, contact optonline@wid.wisc.edu.