Sciweavers

9049 search results - page 346 / 1810
» The New C Standard
Sort
View
CSJM
2006
59views more  CSJM 2006»
15 years 6 months ago
Traveling Salesman Problem with Transportation
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
Valeriu Ungureanu
SIAMDM
2008
143views more  SIAMDM 2008»
15 years 6 months ago
Coloring Bull-Free Perfectly Contractile Graphs
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
Benjamin Lévêque, Frédé...
SIAMJO
2002
96views more  SIAMJO 2002»
15 years 6 months ago
Lagrangian Dual Interior-Point Methods for Semidefinite Programs
This paper proposes a new predictor-corrector interior-point method for a class of semidefinite programs, which numerically traces the central trajectory in a space of Lagrange mul...
Mituhiro Fukuda, Masakazu Kojima, Masayuki Shida
AMC
2011
15 years 1 months ago
Complexity reduction of C-Algorithm
This is a companion paper of [1] and [2]. In the cited papers, using the C-algorithm introduced in [3], many new examples of isochronous centers for Li´enard type equation are fou...
Magali Bardet, Islam Boussaada
STACS
1998
Springer
15 years 11 months ago
Random Sparse Bit Strings at the Threshold of Adjacency
d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
Joel Spencer, Katherine St. John