A branch-and-price procedure for clustering data that are graph connected
From MaRDI portal
Publication:2060392
DOI10.1016/j.ejor.2021.05.043zbMath1490.90290arXiv2104.05454OpenAlexW3169090950MaRDI QIDQ2060392
Justo Puerto, Stefano Benati, Diego Ponce, Antonio M. Rodríguez-Chía
Publication date: 13 December 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.05454
Programming involving graphs or networks (90C35) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05)
Related Items (7)
Segmentation of scanning-transmission electron microscopy images using the ordered median problem ⋮ Robust optimal classification trees under noisy labels ⋮ A branch-and-cut algorithm for the connected max-\(k\)-cut problem ⋮ Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ⋮ A new global algorithm for max-cut problem with chordal sparsity ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem
Cites Work
- Decomposition based hybrid metaheuristics
- Looking for edge-equitable spanning trees
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A cutting plane algorithm for a clustering problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- Cliques and clustering: A combinatorial approach
- Stabilized column generation
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
- Clustering data that are graph connected
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Real-time freight locomotive rescheduling and uncovered train detection during disruption
- Clustering large attributed information networks: an efficient incremental computing approach
- On the multisource hyperplanes location problem to fitting set of points
- Optimization problems for machine learning: a survey
- Noising methods for a clique partitioning problem
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Julia: A Fresh Approach to Numerical Computing
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- On the Maximum Weight Clique Problem
- Adding cohesion constraints to models for modularity maximization in networks
- The Maximum Weight Connected Subgraph Problem
- Selected Topics in Column Generation
- A Primer in Column Generation
- Constraint programming-based column generation
This page was built for publication: A branch-and-price procedure for clustering data that are graph connected
