A Cutting Plane Algorithm for Modularity Maximization Problem

Journal of the Operations Research Society of Japan - Japan
doi 10.15807/jorsj.60.24
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Operations Research Society of Japan

Related search

A Nontangential Cutting Plane Algorithm

2001English

A Doubly Nonnegative Relaxation for Modularity Density Maximization

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

A Cutting-Plane Algorithm for Minimum-Time Trajectory Planning of Industrial Robots

English

On the Cutting Plane Methods for Lagrangian Relaxaion Based Unit Commitment Algorithm

IEEJ Transactions on Power and Energy
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2001English

Detecting Communities in Social Networks Through Modularity Maximization

International Journal of Computer Applications
2018English

Practical Problem Solving With Cutting Plane Algorithms in Combinatorial Optimization

Combinatorial Optimization
1995English

Use of a New Transportation Algorithm for Profit Maximization

European Scientific Journal ESJ
2019English

A Universal CAD System for Cutting Stock Problem

International Journal of Simulation Modelling
ModelingComputer Science ApplicationsSimulation
2017English

The Detection of Earnings Manipulation: The Three-Phase Cutting Plane Algorithm Using Mathematical Programming

Journal of Forecasting
StatisticsProbabilityUncertaintySimulationManagement ScienceComputer Science ApplicationsManagementModelingStrategyOperations Research
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy