Optimization Methods and Software Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713645924 The central path visits all the vertices of the Klee-Minty cube Antoine Deza a; Eissa Nematollahi a; Reza Peyghami a; Tamás Terlaky a a Advanced Optimization Laboratory, Department of Computing and Software, McMaster Un...

A double Dudeney set in Kn is a multiset of Hamilton cycles in Kn having the property that each 2-path in Kn lies in exactly two of the cycles. In this paper, we construct a double Dudeney set in Kn when n = p1p2 · · · ps + 2, where p1, p2, . . . , ps are different odd prime numbers and s is a natural number.

In this paper the Gulers formalism for the systems with finite degrees of freedom is applied to the field theories with constraints. The integrability conditions are investigated and the path integral quantization is performed using the action given by Hamilton-Jacobi formulation. The Proca’s model is investigated in details.

In this paper, we introduce a so-called ‘Multistage graph Simple Path’ (MSP) problem and show that the Hamilton Circuit (HC) problem can be polynomially reducible to the MSP problem. To solve the MSP problem, we propose a polynomial algorithm and prove its NP-completeness. Our result implies NP=P.

Minimizing energy consumption to maximize network lifetime is one of the crucial concerns in designing wireless sensor network routing protocols. Cluster-based protocols have shown promising energy-efficiency performance, where sensor nodes take turns to act as cluster heads (CHs), which carry out higher-level data routing and relaying. In such case the energy consumption is more evenly distrib...

In this paper, we analyze the invasion and extinction of activity in heterogeneous neural fields. We first consider the effects of spatial heterogeneities on the propagation of an invasive activity front. In contrast to previous studies of front propagation in neural media, we assume that the front propagates into an unstable rather than a metastable zero-activity state. For sufficiently locali...

The Kneser graph K (n; k) has as vertices the k-subsets of f1;2;:::;ng. Two vertices are adjacent if the corresponding k-subsets are disjoint. It was recently proved by the rst author 2] that Kneser graphs have Hamilton cycles for n 3k. In this note, we give a short proof for the case when k divides n. x 1. Preliminaries. Suppose that n k 1 are integers and let n] := f1; 2; :::; ng. We denote t...

OBJECTIVE The purpose of the present study was 1) to identify factors that may influence academic stress in medical students and 2) to investigate the causal relationships among these variables with path analysis. METHODS One hundred sixty medical students participated in the present study. Psychological parameters were assessed with the Medical Stress Scale, Minnesota Multiphasic Personality...

We study stochastic differential equations (SDEs) whose drift and diffusion coefficients are path-dependent and controlled. We construct a value process on the canonical path space, considered simultaneously under a family of singular measures, rather than the usual family of processes indexed by the controls. This value process is characterized by a second order backward SDE, which can be seen...

In this article, a notion of viscosity solutions is introduced for first order path-dependent Hamilton–Jacobi–Bellman (PHJB) equations associated with optimal control problems evolution in Hilbert space. We identify the value functional as unique solution to PHJB without assumption (A.4) on page 231 Li and Yong (1995). also show that our consistent corresponding classical solutions, satisfies s...