Results 31 to 40 of about 417,011 (184)
A Stochastic Knapsack Problem with Continuous Random Capacity [PDF]
Journal of Mathematics and Statistics, 2008 Problem Statement: The problem of allocating a set of items in order to maximize the toal linear profit under uncertain capacity referred as a stochastic knapsack problem with continuous random capacity was studied theoretically and computationally.
Suwitchporn Witchakul +2 more
openaire +1 more source
Truthful Assignment without Money [PDF]
, 2010 We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite graph with jobs on one side and machines on the other.
Dughmi, Shaddin, Ghosh, Arpita
core +4 more sources
Algorithms for the minimum spanning tree problem with resource allocation
Operations Research Perspectives, 2016 We formulate the minimum spanning tree problem with resource allocation (MSTRA) in two ways, as discrete and continuous optimization problems (d-MSTRA/c-MSTRA), prove these to be NP-hard, and present algorithms to solve these problems to optimality.
Seiji Kataoka, Takeo Yamada
doaj +1 more source
Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems [PDF]
, 2015 Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel time.
C Chekuri +11 more
core +1 more source
Mathematics, 2018 Moth search (MS) algorithm, originally proposed to solve continuous optimization problems, is a novel bio-inspired metaheuristic algorithm. At present, there seems to be little concern about using MS to solve discrete optimization problems.
Yanhong Feng, Haizhong An, Xiangyun Gao
doaj +1 more source
Lagrangian based approach to solve a two level capacitated lot sizing problem
Cogent Engineering, 2015 Two-level, multi-item, multi-period-capacitated dynamic lot-sizing problem with inclusions of backorders and setup times, TL_CLSP_BS, a well-known NP-hard problem, is solved using a novel procedure.
Mayank Verma, R.R.K. Sharma
doaj +1 more source
, 2015 Patriksson (2008) provided a then up-to-date survey on the continuous,separable, differentiable and convex resource allocation problem with a single resource constraint.
Patriksson, Michael +1 more
core +1 more source
Experimental study on population-based incremental learning algorithms for dynamic optimization problems [PDF]
, 2005 Copyright @ Springer-Verlag 2005.Evolutionary algorithms have been widely used for stationary optimization problems. However, the environments of real world problems are often dynamic. This seriously challenges traditional evolutionary algorithms.
Yang, S, Yao, X
core +2 more sources
An Adaptive Quantum-inspired Differential Evolution Algorithm for 0-1 Knapsack Problem
, 2010 Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces. However, the design of its operators makes it unsuitable for many real-life constrained
Hota, Ashish Ranjan, Pat, Ankit
core +1 more source
Probabilistic communication complexity over the reals [PDF]
, 2007 Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting).
Grigoriev, Dima
core +4 more sources