Work

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation

Year: 2003

Type: article

Source: Journal of Combinatorial Optimization

DOI: 10.1023/a:1027368621279

Authors: Laura Bahiense, Francisco Barahona, Oscar Porto

Institutions: Universidade Federal do Rio de Janeiro, IBM (United States), IBM Research - Thomas J. Watson Research Center, Pontifícia Universidade Católica do Rio de Janeiro

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W71437166

FWCI: 3.229

Cites: 36

Cited by: 26

Related to: 10