Results 41 to 50 of about 790 (89)
Pattern Recognition on Oriented Matroids: Halfspaces, Convex Sets and Tope Committees [PDF]
, 2010 The principle of inclusion-exclusion is applied to subsets of maximal covectors contained in halfspaces of a simple oriented matroid and to convex subsets of its ground set for enumerating tope committees.Comment: 15 pages; v.2 - minor improvements, v.3 ...
Matveev, Andrey O.
core
EURO Journal on Computational Optimization, 2018 An instance of a balanced optimization problem with vector costs consists of a ground set X, a cost-vector for every element of X, and a system of feasible subsets over X.
AnnetteM.C. Ficker +2 more
doaj
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving [PDF]
Computer Science Journal of Moldova, 2005 The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
The generalized sports competition problem [PDF]
, 2002 Consider a sports competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a particular team still has a (theoretical) chance to win ...
Kern, W., Paulusma, D.
core +1 more source
Matching with Couples: a Multidisciplinary Survey [PDF]
This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results.
Flip Klijn, Peter Biro
core
A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem [PDF]
, 2010 AMS Subj. Classification: 90C27, 05C85, 90C59The topic is related to solving the generalized vertex cover problem (GVCP) by genetic algorithm. The problem is NP-hard as a generalization of well-known vertex cover problem which was one of the first problems
Milanović, Marija
core
On hypergraph Lagrangians [PDF]
, 2014 It is conjectured by Frankl and F\"uredi that the $r$-uniform hypergraph with $m$ edges formed by taking the first $m$ sets in the colex ordering of ${\mathbb N}^{(r)}$ has the largest Lagrangian of all $r$-uniform hypergraphs with $m$ edges in \cite{FF}.
Lu, Xiaojun +3 more
core
PANDA: a software for polyhedral transformations
EURO Journal on Computational Optimization, 2015 In this paper, we present the software Parallel AdjaceNcy Decomposition Algorithm (PANDA), an efficient implementation of the vertex and facet enumeration problem for polyhedra. The software is based on the double description method. Special features are
Stefan Lörwald, Gerhard Reinelt
doaj
Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games [PDF]
Computer Science Journal of Moldova, 2005 We study the max-min paths problem, which represents a game version of the shortest and the longest paths problem in a weighted directed graph. In this problem the vertex set V of the weighted directed graph G=(V,E) is divided into two disjoint subsets ...
Dmitrii D. Lozovanu
doaj
Matching with Couples: a Multidisciplinary Survey [PDF]
, 2011 This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results.
Biró, Péter, Klijn, Flip
core