Search Results - (((("_ neural bayes algorithm") OR ("a cut based algorithms"))) OR ("p general cbs algorithm"))~ :: K.UTB vyhledávací portál

Loading…

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

by Ahuja, Ravindra K., Hochbaum, Dorit S., Orlin, James B.
Published in Algorithmica (01.07.2004)

Get full text

Journal Article

Loading…

A cut-based algorithm for reliability analysis of terminal-pair network using OBDD

by Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-yen Kuo
Published in Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003 (2003)

Get full text

Conference Proceeding

Loading…

How to find the convex hull of all integer points in a polyhedron?

by Semenov, S. O., Zolotykh, N. Yu
Published in Optimization letters (01.09.2022)

Get full text

Journal Article

Loading…

How to Find the Convex Hull of All Integer Points in a Polyhedron?

by Semenov, S. O, Zolotykh, N. Yu
Year of Publication 25.10.2020

Get full text

Journal Article

Loading…

How to Find the Convex Hull of All Integer Points in a Polyhedron?

by Semenov, S O, N Yu Zolotykh
Published in arXiv.org (25.10.2020)

Get full text

Paper

Loading…

Solving the Single Rate 2-Pair Network Coding Problem with the A-Set Equation

by Cai, Kai, Letaief, K. B., Fan, Pingyi, Feng, Rongquan
Published in 2011 International Symposium on Networking Coding (01.07.2011)

Get full text

Conference Proceeding

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

A cut-based algorithm for reliability analysis of terminal-pair network using OBDD

How to find the convex hull of all integer points in a polyhedron?

How to Find the Convex Hull of All Integer Points in a Polyhedron?

How to Find the Convex Hull of All Integer Points in a Polyhedron?

Solving the Single Rate 2-Pair Network Coding Problem with the A-Set Equation

Refine Results

Format

Subject Area

Topic

Language

Year of Publication

Database