Logarithmic-exponential penalty formulation for integer programming
From MaRDI portal
Publication:1961727
DOI10.1016/S0893-9659(99)00104-4zbMath0945.90030OpenAlexW2028827978WikidataQ57445553 ScholiaQ57445553MaRDI QIDQ1961727
Publication date: 30 January 2000
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0893-9659(99)00104-4
integer programmingnonlinear integer programminginequality constraintslogarithmic-exponential penalty function
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
General exact penalty functions in integer programming ⋮ Generalized nonlinear Lagrangian formulation for bounded integer programming
Cites Work
- An exact penalty function approach for nonlinear integer programming problems
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- A Survey of Methods for Pure Nonlinear Integer Programming
This page was built for publication: Logarithmic-exponential penalty formulation for integer programming
