Results 81 to 90 of about 143 (125)
On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
, 2020 This paper studies how to set the vehicle capacity for traveling Salesman Problems where some of the customer demands are stochastic. The analyses are done for the one-commodity pickup-and-delivery TSP, as this problem also includes the setting of the ...
Juan-José Salazar-González +1 more
core
Cut Size Statistics Of Graph Bisection Heuristics
, 1997 . We investigate the statistical properties of cut sizes generated by heuristic algorithms which solve approximately the graph bisection problem. On an ensemble of sparse random graphs, we find empirically that the distribution of the cut sizes found by &
Georg R. Schreiber +5 more
core
© Hindawi Publishing Corp. EXTENDED BLOCKER, DELETION, AND CONTRACTION MAPS ON ANTICHAINS
, 2002 Families of maps on the lattice of all antichains of a finite bounded poset that extend the blocker, deletion, and contraction maps on clutters are considered. Influence of the parameters of themaps is investigated.
Andrey O. Matveev
core
Mathematisches Forschungsinstitut Oberwolfach Report No. 50/2005 Combinatorial Optimization
, 2005 . This report summarizes the meeting on Combinatorial Optimization where new and promising developments in the field were discussed. The lectures show the many connections to other branches in Mathematics, like Combinatorics, Graph Theory, Geometry and ...
Uwe Zimmermann (braunschweig +2 more
core
Structural Results For Two-Connected Networks With Rings Of Bounded Cardinality
, 1999 . We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-connected networks with bounded meshes problem studied by Fortz, Labb ...
M. Labbé, B. Fortz
core
RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]
Multiscale Model Simul, 2018 Heroy S +4 more
europepmc +1 more source
Convex Relaxations Of 0-1 Quadratic Programming
, 1993 We consider three parametric relaxations of the 0-1 quadratic programming problem. These relaxations are to: quadratic maximization over simple box constraints, quadratic maximization over the sphere, and the maximum eigenvalue of a bordered matrix. When
Svatopluk Poljak, Henry Wolkowicz
core
A better-than-1.6-approximation for prize-collecting TSP. [PDF]
Math ProgramBlauth J, Klein N, Nägele M.
europepmc +1 more source
Approximate Max-Min Resource Sharing For Structured Concave Optimization
, 1999 . We present a Lagrangian decomposition algorithm which uses logarithmic potential reduction to compute an #-approximate solution of the general max-min resource sharing problem with M nonnegative concave constraints on a convex set B.
J. Villavicencio +3 more
core