Catalogue de la bibliothÃ¨que de l'I2M Search for 'an:166766'
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-search.pl?q=ccl=an:166766&format=rss2
Search results for 'an:166766' at Catalogue de la bibliothÃ¨que de l'I2M850Advances in linear and integer programming 9780198538561
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=9180
By J. E. Beasley.
1996
. 1 vol. (288 p.)
24.
9780198538561

]]>
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=9180An algorithmic theory of numbers, graphs and convexity 0898712033
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=3617
By Laszlo Lovasz.
Society for Industrial and Applied Mathematics 1986
. 1 vol. (III-91 p.)
26.
0898712033

]]>
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=3617Combinatorial optimization 0131524623
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=7747
By Christos H. Papadimitriou, Kenneth Steiglitz.
1982
. 1 vol. (xvi-496 p.)
24.
0131524623

]]>
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=7747Design of survivable networks 9783540475002
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=14168
By Mechthild Stoer.
Springer-Verlag 1992
, The problem of finding an "optimal'' communication network that meets various topological requirements (number of disjoint paths between nodes, and so on) is both important and difficult. This monograph addresses the problem from a polyhedral point of view: What set of linear constraints results in valid communication networks? A number of valid inequalities and facets are found for problems with either node or edge connectivity requirements. These classes of inequalities define the feasible polytope for small problems and seem to be excellent approximations for larger ones. The monograph concludes with a section on implementing a cutting plane algorithm and has a small number of solved instances. In addition to being a thorough examination of this problem, the techniques and approach comprise an excellent example of the polyhedral and cutting plane approach to solving combinatorial optimization models. (MathSciNet)
9783540475002

]]>
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=14168Graphes et algorithmes 9782743010355
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=12449
By Michel Gondran, Michel Minoux.
2009
. 1 vol. (XXXI-784 p.)
, The authors present theory and applications of graph theory in twelve chapters: basic concepts, shortest paths, the algebra of paths, trees and arborescences, flows and transportation networks, flows in networks with gains and multi-commodity network flows, matchings and b-matchings, Eulerian and Hamiltonian tours, matroids, difficult problems within the class NP, implicit enumeration and approximate algorithms, followed by five appendices on linear (integer) programming, Lagrangean relaxation, dynamic and fractional programming. This 4th edition takes account of recent developments not only by an updated bibliography and an improved overall presentation. Biology-inspired approximate algorithms such as genetic and ant colony algorithms are included, and (iterative) randomized greedy algorithms are treated in detail. With one hundred applications modelled and over two hundred exercises of different levels this textbook continues to be one of the basic references in algorithmic graph theory. (Zentralblatt)
25.
9782743010355

]]>
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=12449Grobner bases and convex polytopes 0821804871
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=8796
By Bernd Sturmfels.
AMS 1996
. 1 vol. (xi-162 p.)
26.
0821804871

]]>
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=8796Logic-based decision support 0444871195
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=7096
By Robert G. Jeroslow.
North-Holland 1989
. 1 vol. (222 p.)
, Traditionally, research fields as integer programming and automated theorem proving were quite separate disciplines and few researchers were active in both of them. While integer programming mainly belongs to operations research, automated theorem proving is rather a part of mathematical logic. But in this book, a bridge connecting these two disciplines is built. The text is divided into two main parts: (1) mixed integer programming, and (2) logical decision methods based on theorem proving methods. (Zentralblatt)
25.
0444871195

]]>
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=7096Matching theory 9780444879165
http://catalogue.cmi.univ-mrs.fr/cgi-bin/koha/opac-detail.pl?biblionumber=7636
By L. Lovasz, M. D. Plummer.
North-Holland 1986
. 1vol. (XXXIII-544 p.)
24.
9780444879165