Exact and Approximate Algorithms for Part-Machine Clustering Based on a Relationship Between Interval Graphs and Robinson Matrices

IIE Transactions
doi 10.1080/07408170701411393
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Informa UK Limited

Related search

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2011English

Exact and Approximate Inference for Annotating Graphs With Structural SVMs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Stochastic Algorithms for Exact and Approximate Feasibility of Robust LMIs

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2001English

On Some Matrices Associated With Interval Valued Fuzzy Graphs

New Trends in Mathematical Science
2019English

Efficiency Comparison of Exact and Approximate Algorithms for Solving Set Covering Problem

Vestnik of Don State Technical University
2017English

Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2015English

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2009English

Parallel Maximum Matching Algorithms in Interval Graphs

International Journal of Foundations of Computer Science
Computer Science
1999English

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy