A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613): Difference between revisions

Latest revision as of 00:23, 14 July 2024

scientific article; zbMATH DE number 6735454

Language	Label	Description	Also known as
English	A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering	scientific article; zbMATH DE number 6735454

Statements

instance of

scholarly article

0 references

title

A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (English)

0 references

0 references

0 references

Clusters, Orders, and Trees: Methods and Applications

0 references

publication date

26 June 2017

0 references

zbMATH Keywords

0-1 fractional programming

0 references

submodular function

0 references

polynomial algorithm

0 references

composite functions

0 references

additive clustering

0 references

describes a project that uses

MAPCLUS

0 references

Indclus

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4939-0742-7_2

0 references

cites work

Q3056948

0 references

MAPCLUS: A mathematical programming approach to fitting the ADCLUS model

0 references

Notes—On a Selection Problem

0 references

A comparison of two methods for fitting the INDCLUS model

0 references

Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions

0 references

Complexity of some parametric integer and network programming problems

0 references

On the polynomial mixed 0-1 fractional programming problems

0 references

Programming with linear fractional functionals

0 references

An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models

0 references

Approximating a class of combinatorial problems with rational objective function

0 references

Q4039777

0 references

On submodular function minimization

0 references

GENNCLUS: New models for general nonhierarchical clustering analysis

0 references

On Nonlinear Fractional Programming

0 references

Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

0 references

Maximizing Non-monotone Submodular Functions

0 references

Fractional Programming

0 references

On the supermodular knapsack problem

0 references

A Fast Parametric Maximum Flow Algorithm and Applications

0 references

Q4198056

0 references

Minimizing submodular functions over families of sets

0 references

Structural and algorithmic properties for parametric minimum cuts

0 references

The ellipsoid method and its consequences in combinatorial optimization

0 references

Geometric algorithms and combinatorial optimization

0 references

Q3895490

0 references

Q5538300

0 references

Maximizing the Product of Two Linear Functions In 0-1 Variables

0 references

Hyperbolic 0-1 programming and query optimization in information retrieval

0 references

Some Network Flow Problems Solved with Pseudo-Boolean Programming

0 references

A Faster Scaling Algorithm for Minimizing Submodular Functions

0 references

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

0 references

A modification of the SINDCLUS algorithm for finding the ADCLUS and INCLUS models

0 references

Q5292089

0 references

Q4040221

0 references

A faster strongly polynomial time algorithm for submodular function minimization

0 references

A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory

0 references

How much precision is needed to compare two sums of square roots of integers?

0 references

A Selection Problem of Shared Fixed Costs and Network Flows

0 references

Q4178771

0 references

Q5465347

0 references

A combinatorial algorithm minimizing submodular functions in strongly polynomial time.

0 references

Q4368736

0 references

A sixth bibliography of fractional programming

0 references

Minimizing a Submodular Function on a Lattice

0 references

A bad network problem for the simplex method and other minimum cost flow algorithms

0 references

Identifiers

zbMATH Open document ID

1365.90248

0 references

DOI

10.1007/978-1-4939-0742-7_2

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5270613

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-1-4939-0742-7_2
+Normal rank
@@ Property / OpenAlex ID @@
+W1033702490
@@ Property / OpenAlex ID: W1033702490 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
+Normal rank
@@ Property / cites work @@
+Notes—On a Selection Problem
@@ Property / cites work: Notes—On a Selection Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of two methods for fitting the INDCLUS model
+Normal rank
@@ Property / cites work @@
+Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
+Normal rank
@@ Property / cites work @@
+Complexity of some parametric integer and network programming problems
+Normal rank
@@ Property / cites work @@
+On the polynomial mixed 0-1 fractional programming problems
+Normal rank
@@ Property / cites work @@
+Programming with linear fractional functionals
@@ Property / cites work: Programming with linear fractional functionals / rank @@
+Normal rank
@@ Property / cites work @@
+An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models
+Normal rank
@@ Property / cites work @@
+Approximating a class of combinatorial problems with rational objective function
+Normal rank
@@ Property / cites work @@
+Q4039777
@@ Property / cites work: Q4039777 / rank @@
+Normal rank
@@ Property / cites work @@
+On submodular function minimization
@@ Property / cites work: On submodular function minimization / rank @@
+Normal rank
@@ Property / cites work @@
+GENNCLUS: New models for general nonhierarchical clustering analysis
+Normal rank
@@ Property / cites work @@
+On Nonlinear Fractional Programming
@@ Property / cites work: On Nonlinear Fractional Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
+Normal rank
@@ Property / cites work @@
+Maximizing Non-monotone Submodular Functions
@@ Property / cites work: Maximizing Non-monotone Submodular Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional Programming
@@ Property / cites work: Fractional Programming / rank @@
+Normal rank
@@ Property / cites work @@
+On the supermodular knapsack problem
@@ Property / cites work: On the supermodular knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing submodular functions over families of sets
+Normal rank
@@ Property / cites work @@
+Structural and algorithmic properties for parametric minimum cuts
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q3895490
@@ Property / cites work: Q3895490 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538300
@@ Property / cites work: Q5538300 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the Product of Two Linear Functions In 0-1 Variables
+Normal rank
@@ Property / cites work @@
+Hyperbolic 0-1 programming and query optimization in information retrieval
+Normal rank
@@ Property / cites work @@
+Some Network Flow Problems Solved with Pseudo-Boolean Programming
+Normal rank
@@ Property / cites work @@
+A Faster Scaling Algorithm for Minimizing Submodular Functions
+Normal rank
@@ Property / cites work @@
+A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
+Normal rank
@@ Property / cites work @@
+A modification of the SINDCLUS algorithm for finding the ADCLUS and INCLUS models
+Normal rank
@@ Property / cites work @@
+Q5292089
@@ Property / cites work: Q5292089 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+A faster strongly polynomial time algorithm for submodular function minimization
+Normal rank
@@ Property / cites work @@
+A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
+Normal rank
@@ Property / cites work @@
+How much precision is needed to compare two sums of square roots of integers?
+Normal rank
@@ Property / cites work @@
+A Selection Problem of Shared Fixed Costs and Network Flows
+Normal rank
@@ Property / cites work @@
+Q4178771
@@ Property / cites work: Q4178771 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5465347
@@ Property / cites work: Q5465347 / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
+Normal rank
@@ Property / cites work @@
+Q4368736
@@ Property / cites work: Q4368736 / rank @@
+Normal rank
@@ Property / cites work @@
+A sixth bibliography of fractional programming
@@ Property / cites work: A sixth bibliography of fractional programming / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing a Submodular Function on a Lattice
@@ Property / cites work: Minimizing a Submodular Function on a Lattice / rank @@
+Normal rank
@@ Property / cites work @@
+A bad network problem for the simplex method and other minimum cost flow algorithms
+Normal rank