Online planning algorithms are typically a tool of choice for dealing with sequential decision problems in combinatorial search spaces. Many such problems, however, also exhibit combinatorial actions, yet standard planning algorithms do not cope well with this type of “the curse of dimensionality." Following a recently opened line of related work on combinatorial multi-armed bandit (CMAB) probl...

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...

The article addresses the issues of combinatorial evolution of standards in transmission of multimedia information including the following: (a) brief descriptions of basic combinatorial models as multicriteria ranking, knapsack-like problems, clustering, combinatorial synthesis, multistage design, (b) a description of standard series (MPEG) for video information processing and a structural (com...

this research uses a comprehensive method to solve a combinatorial problem of distribution network expansion planning (dnep) problem. the proposed multi-objective scheme aims to improve power system's accountability and system performance parameters, simultaneously, in the lowest possible costs. the dynamic programming approach is implemented in order to find the optimal sizing, siting and...

Recently, researchers have proposed decision support tool for generating suggestions for bids in combinatorial reverse auction based on disclosure of bids. An interesting issue is to design an effective mechanism to guide the bidders to collectively minimize the overall cost without explicitly disclosing the bids. We consider a winner determination problem for combinatorial reverse auction and ...

This research uses a comprehensive method to solve a combinatorial problem of distribution network expansion planning (DNEP) problem. The proposed multi-objective scheme aims to improve power system's accountability and system performance parameters, simultaneously, in the lowest possible costs. The dynamic programming approach is implemented in order to find the optimal sizing, siting and timi...

The T -graph of a multigraded Hilbert scheme records the zero and one-dimensional orbits of the T = (K∗)n action on the Hilbert scheme induced from the T -action on A. It has vertices the T -fixed points, and edges the onedimensional T -orbits. We give a combinatorial necessary condition for the existence of an edge between two vertices in this graph. For the Hilbert scheme of points in the pla...

The notion of a regular anonymous perfect threshold scheme is introduced, and a combinatorial characterization for such a (2,w)-threshold scheme in terms of a regular difference family is given.  2002 Elsevier Science B.V. All rights reserved.