Sciweavers

1723 search results - page 59 / 345
» Cycling in linear programming problems
Sort
View
74
Voted
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
15 years 2 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin
82
Voted
EOR
2006
71views more  EOR 2006»
15 years 2 months ago
Control and optimal response problems for quasilinear impulsive integrodifferential equations
One of the central results of the paper is the Pontryagin maximum principle [16] which is considered in sufficient form for the linear case of impulsive differential equations. Th...
M. U. Akhmet, M. Kirane, M. A. Tleubergenova, Gerh...
MP
2002
85views more  MP 2002»
15 years 2 months ago
Generalized Goal Programming: polynomial methods and applications
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Emilio Carrizosa, Jörg Fliege
137
Voted
CATS
2008
15 years 4 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
120
Voted
HEURISTICS
2002
155views more  HEURISTICS 2002»
15 years 2 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz