Optimal Two-Agent Coordination for Graph Traversal: When Is Formation Travel Beneficial?

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.130, Iss.3, 2006-09, pp. : 489-503

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

Abstract

Related content

A Generalized Two-Agent Location Problem: Asymmetric Dynamics and Coordination

By Golany Boaz Kogan Konstantin Rothblum Uriel

Journal of Optimization Theory and Applications, Vol. 148, Iss. 2, 2011-02 ,pp. : 336-363

Springer Publishing Company

Access to resources Recommend Favorite

Two-agent Pareto optimal cooperative investment in general semimartingale model

By Zhou Qing

Optimization, Vol. 60, Iss. 4, 2011-04 ,pp. : 463-476

Taylor & Francis Ltd

Access to resources Recommend Favorite

A note on the complexity of the problem of two-agent scheduling on a single machine

By Ng C. Cheng T. Yuan J.

Journal of Combinatorial Optimization, Vol. 12, Iss. 4, 2006-12 ,pp. : 387-394

Springer Publishing Company

Access to resources Recommend Favorite

Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata

By Beame P. Borodin A. Raghavan P. Ruzzo W.L. Tompa M.

Information and Computation, Vol. 130, Iss. 2, 1996-11 ,pp. : 101-129

Academic Press

Access to resources Recommend Favorite

When Are Two Figures Congruent?

By Wetzel John E.

The College Mathematics Journal, Vol. 41, Iss. 3, 2010-05 ,pp. : 193-196

Mathematical Association of America

Access to resources Recommend Favorite