On Connections between Zero-One Integer Programming and Concave Programming under Linear Constraints
This is a preview. Log in through your library . With over 12,500 members from around the globe, INFORMS is the leading international association for professionals in operations research and analytics ...
The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method ...
Motivation for Research: Large combinatorial optimization problems involve an exponentially growing decision space, where finding a good solution often becomes extremely difficult using traditional ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results