NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM

スポンサーリンク

概要

• 論文の詳細を見る

• It is well-known that the tight lower bounds determine the effectiveness of the branch and bound method for the NP-hard problems. In this paper, we present a new lower bounding procedure for the capacitated arc routing problem (CARP), one of the arc routing problems. They give the tight lower bounds and it is easy to develop an exact algorithm using their network structures.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Saruwatari Yasufumi

  Department Of Management Science Science University Of Tokyo

• Hirabayashi Ryuichi

  Department of Management Science, Science University of Tokyo

• Nishida Naonori

  Department of Management Science, Science University of Tokyo

• Nishida N

  Department Of Management Science Science University Of Tokyo

• NISHIDA NAONORI

  Department of Chemical Engineering, Carnegie-Mellon University

関連論文

• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
• Structure of zero set for differentiable map
• On the computational technique of optimal synthesis problem using structure parameters.

スポンサーリンク