A Monte-Carlo approach for 0-1 programming problems
From MaRDI portal
Publication:1195974
DOI10.1007/BF02238637zbMath0764.65032MaRDI QIDQ1195974
J. Sobczynska, Luca Brandolini, Marida Bertocchi, Leon Slominski
Publication date: 11 January 1993
Published in: Computing (Search for Journal in Brave)
order statisticscomputational experimentsdiscrete optimizationlinear \(0-1\) multi-knapsack problemsMonte-Carlo searchNP-hard \(0-1\) optimization problemstwo-phase global random search procedure
Numerical mathematical programming methods (65K05) Order statistics; empirical distribution functions (62G30) Monte Carlo methods (65C05) Boolean programming (90C09)
Related Items (4)
A discrete dynamic convexized method for nonlinear integer programming ⋮ An approximate algorithm for nonlinear integer programming ⋮ A new filled function method for nonlinear integer programming problem ⋮ Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
Cites Work
This page was built for publication: A Monte-Carlo approach for 0-1 programming problems
