Results 71 to 80 of about 95 (88)

Feasible Bases for a Polytope Related to the Hamilton Cycle Problem

Mathematics of Operations Research, 2021
Thomas Kalinowski, Sogol Mohammadian
exaly  

The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP

Mathematics of Operations Research, 2023
Samuel C Gutekunst, David P Williamson
exaly  

Hamiltonian Cycles and Subsets of Discounted Occupational Measures

Mathematics of Operations Research, 2020
Ali Eshragh, Jerzy A Filar, Thomas Kalinowski   +2 more
exaly  

The mean field traveling salesman and related problems

Acta Mathematica, 2010
Johan Wästlund
exaly  

Extremal problems with respect to ideal boundary components of an infinite network

Hiroshima Mathematical Journal, 1989
Maretsugu Yamasaki
exaly  

Target K-coverage problem in wireless sensor networks

Journal of Discrete Mathematical Sciences and Cryptography, 2020
Sandeep Kumar
exaly  

Random matching problems on the complete graph

Electronic Communications in Probability, 2008
Johan Wästlund
exaly  

An easy proof of the $\zeta(2)$ limit in the random assignment problem

Electronic Communications in Probability, 2009
Johan Wästlund
exaly  

PARTITION OF A SET OF INTEGERS INTO SUBSETS WITH PRESCRIBED SUMS

Taiwanese Journal of Mathematics, 2005
Hung-Lin Fu, Yiju Wang
exaly  

Convexification of Bilinear Terms over Network Polytopes

Mathematics of Operations Research
Danial Davarnia
exaly