Skip to content

Optimization Online

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

A Cardinality-Disaggregated Extended Formulation and Cutset Inequalities for the Steiner Tree Problem

Published: 2026/06/10
  • shahrukhanjum
  • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms, Polyhedra Tags branch-and-cut, cardinality, cutset inequalities, disaggregation, extended formulation, steiner tree problem, valid inequalities Short URL: https://optimization-online.org/?p=35161

    Article

    Download

    View PDF

    Post navigation
    On the existence of Lagrange multipliers in conic programming
    Advancing Branch-and-Price for Graph Coloring: New Pricing Strategies and Benchmark Results
    Log in


    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers augmented lagrangian method benders decomposition bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity constrained 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 multiobjective optimization 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

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