Finite checkability for integer rounding properties in combinatorial programming problems

1982 ◽  
Vol 22 (1) ◽  
pp. 141-147 ◽  
Author(s):  
S. Baum ◽  
L. E. Trotter
Keyword(s):  
Integer Rounding ◽  
Combinatorial Programming

Polyhedral Sets and Integer Rounding

2000 ◽  
Vol 3 ◽  
pp. 1-4
Author(s):  
T NIESSEN ◽  
J KIND
Keyword(s):  
Polyhedral Sets ◽  
Integer Rounding

Integer Rounding for Polymatroid and Branching Optimization Problems

1981 ◽  
Vol 2 (4) ◽  
pp. 416-425 ◽  
Author(s):  
S. Baum ◽  
L. E. Trotter, Jr.
Keyword(s):  
Optimization Problems ◽  
Integer Rounding

scholarly journals P-Path Minimum Distance Connectivity from Head Quarter to the Cities

2013 ◽  
Vol 4 (2) ◽  
pp. 280-294
Author(s):  
Revathi P ◽  
Suresh Babu C ◽  
Purusotham S ◽  
Sundara Murthy M
Keyword(s):  
Pattern Recognition ◽  
Minimum Distance ◽  
Search Algorithm ◽  
Distance Matrix ◽  
Pattern Recognition Technique ◽  
Individual Factor ◽  
Linear Polynomial ◽  
Higher Dimensional ◽  
Combinatorial Programming ◽  
Recognition Technique

Many Combinatorial programming problems are NP-hard (Non Linear Polynomial), and we consider one of them called P path minimum distance connectivity from head quarter to the cities. Let there be n cities and the distance matrix D(i, j, k) is given from ithcity to jthcity using kthfacility. There can be an individual factor which influences the distances/cost and that factor is represented as a facility k. We consider m<n cities are in cluster and to connect all the cities in subgroup (cluster) from others by using same facility k. The problem is to find minimum distance to connect all the cities from head quarter (say 1) threw p-paths subject to the above considerations. For this problem we developed a Pattern Recognition Technique based Lexi Search Algorithm, we programmed the proposed algorithm using C. we compared with the existed models and conclude that it suggested for solving the higher dimensional problems.

Polyhedral Sets and Integer Rounding

1999 ◽  
Vol 3 ◽  
pp. 142-145
Author(s):  
Thomas Niessen ◽  
Jaakob Kind
Keyword(s):  
Polyhedral Sets ◽  
Integer Rounding

Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems

1973 ◽  
Vol 19 (5) ◽  
pp. 528-543 ◽  
Author(s):  
John F. Pierce ◽  
Jeffrey S. Lasky
Keyword(s):  
Integer Programming ◽  
Combinatorial Programming ◽  
Integer Programming Problems ◽  
Programming Algorithms

Random pseudo-polynomial algorithms for some combinatorial programming problems

1992 ◽  
Vol 58 (2) ◽  
pp. 223-235
Author(s):  
G. Galbiati ◽  
F. Maffioli
Keyword(s):  
Polynomial Algorithms ◽  
Combinatorial Programming

scholarly journals Linear and combinatorial programming

1978 ◽  
Vol 4 (3) ◽  
pp. 281
Author(s):  
D.I. Steinberg
Keyword(s):  
Combinatorial Programming

scholarly journals Author response: Combinatorial programming of human neuronal progenitors using magnetically-guided stoichiometric mRNA delivery

2018 ◽  
Author(s):  
Sayyed M Azimi ◽  
Steven D Sheridan ◽  
Mostafa Ghannad-Rezaie ◽  
Peter M Eimon ◽  
Mehmet Fatih Yanik
Keyword(s):  
Author Response ◽  
Neuronal Progenitors ◽  
Combinatorial Programming
Sign in / Sign up

Export Citation Format

Share Document