NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4  (07-2015)

Period of time： 2015年4期

Publisher： John Wiley & Sons Inc

Founded in： 1971

Total resources： 27

E-ISSN： 1097-0037|65|4

ISSN： 0028-3045

Subject： O Mathematical Sciences and Chemical

Favorite

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

NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4

Menu

Preface

NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4 , Vol. 65, Iss. 4, 2015-07 , pp. 287-288

John Wiley & Sons Inc

Abstract Access to resources Recommend Favorite

Stochastic maximum weight forest problem

NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4 , Vol. 65, Iss. 4, 2015-07 , pp. 289-305

John Wiley & Sons Inc

Abstract Access to resources Recommend Favorite

An incremental algorithm for the uncapacitated facility location problem

NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4 , Vol. 65, Iss. 4, 2015-07 , pp. 306-311

John Wiley & Sons Inc

Abstract Access to resources Recommend Favorite

Network spot‐checking games: Theory and application to toll enforcing in transportation networks

NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4 , Vol. 65, Iss. 4, 2015-07 , pp. 312-328

John Wiley & Sons Inc

Abstract Access to resources Recommend Favorite

Formulations and exact solution approaches for the degree preserving spanning tree problem

NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4 , Vol. 65, Iss. 4, 2015-07 , pp. 329-343

John Wiley & Sons Inc

Abstract Access to resources Recommend Favorite

On the complexity of equal shortest path routing

NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4 , Vol. 65, Iss. 4, 2015-07 , pp. 344-352

John Wiley & Sons Inc

Abstract Access to resources Recommend Favorite

A branch‐and‐price algorithm for the (k,c)‐coloring problem

NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4 , Vol. 65, Iss. 4, 2015-07 , pp. 353-366

John Wiley & Sons Inc

Abstract Access to resources Recommend Favorite

Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem

NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4 , Vol. 65, Iss. 4, 2015-07 , pp. 367-379

John Wiley & Sons Inc

Abstract Access to resources Recommend Favorite

Efficient Edge‐swapping heuristics for the reload cost spanning tree problem

NETWORKS: AN INTERNATIONAL JOURNAL,volume 65,issue 4 , Vol. 65, Iss. 4, 2015-07 , pp. 380-394

John Wiley & Sons Inc

Abstract Access to resources Recommend Favorite

Total 9 item(s)