Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
From MaRDI portal
Publication:4319492
DOI10.1057/jors.1994.172zbMath0815.90117OpenAlexW1989122463MaRDI QIDQ4319492
Publication date: 11 January 1995
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1994.172
Related Items (7)
Fractional 0-1 programming: applications and algorithms ⋮ An efficient linearization technique for mixed 0-1 polynomial problem ⋮ Linear forms of nonlinear expressions: new insights on old ideas ⋮ Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem ⋮ A linearization method for mixed 0--1 polynomial programs ⋮ A fuzzy-budgeted robust optimization model for joint network design-pricing problem in a forward-reverse supply chain: the viewpoint of third-party logistics ⋮ Comments on ``Fuzzy programming with nonlinear membership functions \(\dots\)
This page was built for publication: Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
