On the Two-Stage Stochastic Graph Partitioning Problem

Neng Fan; Qipeng P. Zheng; Pãnos M. Pardalos

doi:10.1007/978-3-642-22616-8_39

ScienceGate Book Chapters

BOOK-CHAPTER

On the Two-Stage Stochastic Graph Partitioning Problem

Neng Fan Qipeng P. Zheng Pãnos M. Pardalos

Year: 2011 Lecture notes in computer science Pages: 500-509 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-642-22616-8_39

Get Full-Text PDF Get Analytical Report

Keywords:

Integer programming Computer science Mathematical optimization Stochastic programming Linear programming Graph partition Graph Binary number Algorithm Theoretical computer science Mathematics

Metrics

Cited By

1.71

FWCI (Field Weighted Citation Impact)

Refs

0.84

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Transportation Planning and Optimization

Social Sciences → Social Sciences → Transportation

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Multi-Criteria Decision Making

Social Sciences → Decision Sciences → Management Science and Operations Research

On the Two-Stage Stochastic Graph Partitioning Problem

Metrics

Citation History

Topics

Related Documents

Two-stage m-way graph partitioning

Stochastic quay partitioning problem

TWO-STAGE STOCHASTIC PROGRAMMING PROBLEM CONSIDERING VARIANCE

Local Graph Edge Partitioning with a Two-Stage Heuristic Method

Multirobot Stochastic Patrolling via Graph Partitioning