Existence of directedwhist tournaments with the three person property 3PDWh(v)3PDWh(v) Fulltext Access 8 Pages 2006
The (α,β,s,t)(α,β,s,t)-diameter of graphs: A particular case of conditional diameter Fulltext Access 8 Pages 2006
On graphs on n vertices having an identifying code of cardinality ⌈log2(n+1)⌉⌈log2(n+1)⌉ Fulltext Access 8 Pages 2006
Polynomial recognition of equal unions in hypergraphs with few vertices of large degree Fulltext Access 8 Pages 2006
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem Fulltext Access 8 Pages 2006
Augmented Lagrangian function, non-quadratic growth condition and exact penalization Fulltext Access 8 Pages 2006
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints Fulltext Access 8 Pages 2006
An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times Fulltext Access 8 Pages 2006
A new asymmetric pyramidally solvable class of the traveling salesman problem Fulltext Access 8 Pages 2006
Quality of move-optimal schedules for minimizing total weighted completion time Fulltext Access 8 Pages 2006
Bayesian solution to pricing and inventory control under unknown demand distribution Fulltext Access 8 Pages 2006
On non-rank facets of stable set polytopes of webs with clique number four Fulltext Access 8 Pages 2006
The robust shortest path problem in series–parallel multidigraphs with interval data Fulltext Access 8 Pages 2006
Symmetric matrices and codes correcting rank errors beyond the ⌊(d-1)/2⌋⌊(d-1)/2⌋ bound Fulltext Access 8 Pages 2006
Algorithms for clique-independent sets on subclasses of circular-arc graphs Fulltext Access 8 Pages 2006
A concentration bound for the longest increasing subsequence of a randomly chosen involution Fulltext Access 8 Pages 2006
Further combinatorial identities deriving from the n th power of a 2×22×2 matrix Fulltext Access 8 Pages 2006
On the coexistence of conference matrices and near resolvable 2-(2k+1,k,k-1) designs Fulltext Access 9 Pages 2006
Descending plane partitions and rhombus tilings of a hexagon with a triangular hole Fulltext Access 9 Pages 2006
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture Fulltext Access 9 Pages 2006
Upper bounds given by equitable partitions of a primitive association scheme Fulltext Access 9 Pages 2006
Finding minimum hidden guard sets in polygons—tight approximability results Fulltext Access 9 Pages 2006
An Extension of the Classification-Tree Method for Embedded Systems for the Description of Events Fulltext Access 9 Pages 2006
Decision Trees of Algorithms and a Semivaluation to Measure Their Distance Fulltext Access 9 Pages 2006
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite Fulltext Access 9 Pages 2006
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs Fulltext Access 9 Pages 2006
Sports tournaments, home–away assignments, and the break minimization problem Fulltext Access 9 Pages 2006
Determining the right-hand vectors of an irredundant linear inequality system Fulltext Access 9 Pages 2006
Finite buffer vacation models under E-limited with limit variation service and Markovian arrival process Fulltext Access 9 Pages 2006
Threshold control by a single-server retrial queue with batch arrivals and group services Fulltext Access 9 Pages 2006
Approximations for the mean queue length of the GIX/G(b,b)/cGIX/G(b,b)/c queue Fulltext Access 9 Pages 2006
Resource augmentation in two-dimensional packing with orthogonal rotations Fulltext Access 9 Pages 2006