4.1 Article

The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms

Related references

Note: Only part of the references are listed.
Article Operations Research & Management Science

Arc-based integer programming formulations for three variants of proportional symbol maps

Rafael G. Cano et al.

DISCRETE OPTIMIZATION (2015)

Article Computer Science, Interdisciplinary Applications

Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem

Bernard Gendron et al.

INFORMS JOURNAL ON COMPUTING (2014)

Article Computer Science, Software Engineering

Generating optimal drawings of physically realizable symbol maps with integer programming

Guilherme Kunigami et al.

VISUAL COMPUTER (2012)

Article Computer Science, Software Engineering

Algorithmic Aspects of Proportional Symbol Maps

Sergio Cabello et al.

ALGORITHMICA (2010)

Article Operations Research & Management Science

Practical enhancements to the Magnanti-Wong method

Nikolacis Papadakos

OPERATIONS RESEARCH LETTERS (2008)

Article Mathematics, Applied

The Minimum-Area Spanning Tree problem

Paz Carmi et al.

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS (2006)

Article Management

Combinatorial benders' cuts for mixed-integer linear programming

Gianni Codato et al.

OPERATIONS RESEARCH (2006)

Article Computer Science, Interdisciplinary Applications

A survey on benders decomposition applied to fixed-charge network design problems

AM Costa

COMPUTERS & OPERATIONS RESEARCH (2005)

Article Computer Science, Hardware & Architecture

On the power assignment problem in radio networks

AEF Clementi et al.

MOBILE NETWORKS & APPLICATIONS (2004)

Article Computer Science, Software Engineering

Benchmarking optimization software with performance profiles

ED Dolan et al.

MATHEMATICAL PROGRAMMING (2002)