14158 search results - page 269 / 2832 » Generalized switch-setting problems |
131
click to vote
FGCS
2000
15 years 3 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
132
Voted
ORL
1998
15 years 3 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
135
Voted
DLOG
2009
15 years 1 months ago
2009
We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute i...
135
click to vote
AI
1998
Springer
15 years 3 months ago
1998
Springer
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
102
click to vote
ORL
2007
15 years 3 months ago
2007
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one ...