Counting Integer Flows in Networks

Author： Baldoni-Silva W. Loera J. A. Vergne M.

ISSN： 1615-3375

Source： Foundations of Computational Mathematics, Vol.4, Iss.3, 2004-07, pp. : 277-314

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Integer programming, Constraint programming, and metaheuristic approaches for static optimization of anycast flows in elastic optical networks

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 4, 2015-12 ,pp. : 253-266

John Wiley & Sons Inc

Access to resources Recommend Favorite

Integer programming, Barvinok's counting algorithm and Gomory relaxations

By Lasserre J.B.

Operations Research Letters, Vol. 32, Iss. 2, 2004-03 ,pp. : 133-137

Elsevier

Access to resources Recommend Favorite

Asymptotic periodicity of recurrent flows in infinite networks

By Dorn Britta Keicher Vera Sikolya Eszter

Mathematische Zeitschrift, Vol. 263, Iss. 1, 2009-09 ,pp. : 69-87

Springer Publishing Company

Access to resources Recommend Favorite

An Integer Lattice Realization of a Lax Scheme for Transport Processes in Multiple Component Fluid Flows

By Succi S. Chen H. Teixeira C. Bella G. de Maio A. Molvig K.

Journal of Computational Physics, Vol. 152, Iss. 2, 1999-07 ,pp. : 493-516

Academic Press

Access to resources Recommend Favorite

A hybrid molecular-continuum simulation method for incompressible flows in micro/nanofluidic networks

By Borg Matthew Lockerby Duncan Reese Jason

Microfluidics and Nanofluidics, Vol. 15, Iss. 4, 2013-10 ,pp. : 541-557

Springer Publishing Company

Access to resources Recommend Favorite