Consider the relaxation of an integer programming (IP) problem in which the feasible region is replaced by the intersection of the linear programming (LP) feasible region and the corner polyhedron for a particular LP basis. Recently a primal-dual ascent algorithm has been given for solving this relaxation. Given an optimal solution of this relaxation, we state criteria for selecting a new LP ba...

No part of this Journal may be reproduced in any form, by print, photoprint, mi-croolm or any other means without written permission from Faculty of Technical : Abstract We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic variable having a negative reduced cost, the pivot rule produces a sequence of pivots s...

Objective- The purpose of this study was to investigate the feasibility of performing echocardiography in apparently healthy pigeons, and measurement of the quantitative cardiac indices using B-mode and Doppler techniques. Design- Experimental study Animals- Ten apparently healthy pigeons Procedures- Echocardi...

This paper proposes three strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem. These three relaxations are incomparable to each other and two of them are incomparable to the standard SDP relaxation of OPF. Extensive computational experiments show that these relaxations have numerous advantages over existing convex relaxations in the literature: (i...

Background: Nanoparticles have been applied to medicine, hygiene, pharmacy and dentistry, and will bring significant advances in the prevention, diagnosis, drug delivery and treatment of disease. Green synthesis of metal nanoparticles has a very important role in nanobiotechnology, allowing production of non-toxic and eco-friendly particles.Objectives: Gr...

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutti...

Z. Naturforsch. 38 b, 1635-1642 (1983); received June 7, 1983 Walk Rearrangement, Cyclopentadienylphosphanes, Molecular-Orbital Study The walk rearrangement of cyclopentadienylphosphanes and related compounds is analyzed on the basis of a quantum chemical study. Although according to orbital symmetry considerations the reaction takes place with retention of configuration (at the migrating atom)...

Vertex Descent is a local search algorithm which forms the basis of a wide spectrum of tabu search, simulated annealing and hybrid evolutionary algorithms for graph colouring. These algorithms are usually treated as experimental and provide strong results on established benchmarks. As a step towards studying these heuristics analytically, an analysis of the behaviour of Vertex Descent is provid...

Theoretical analysis of hadron dynamics in main part relies upon the renormalization group (RG) method. However, construction of exact solutions to the RG equation is still far from being feasible. Usually, in order to describe the strong interaction processes in asymptotical ultraviolet (UV) region, one applies the RG method together with perturbative calculations. The relevant approximate sol...

Social networking sites, such as Facebook, have gained immense popularity as communication platforms and as advertising tools. Generation Yers have a strong need to engage with others and make connections-digitally and in person. This paper examines the Facebook behavior of Generation Y by means of a self-administered survey of 383 university students. The purpose of this research was to determ...