Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ; volume:98 ; number:2 ; day:9 ; month:9 ; year:2023 ; pages:269-297 ; date:10.2023
Mathematical methods of operations research ; 98, Heft 2 (9.9.2023), 269-297, 10.2023
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00186-023-00835-y
- URN
-
urn:nbn:de:101:1-2024010508022004176762
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:31 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Belyi, Alexander
- Sobolevsky, Stanislav
- Kurbatski, Alexander
- Ratti, Carlo
- SpringerLink (Online service)
Ähnliche Objekte (12)
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
The partitioning of constraints
The partitioning of constraints
Concise integer linear programming formulation for clique partitioning problems
A stepped tabu search method for the clique partitioning problem
Locally Exact Lower Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints
Cliquen
Exact BPS bound for noncommutative baby Skyrmions
Proteome partitioning constraints in long-term laboratory evolution
The exact distribution of the Hansen-Jagannathan bound
Dispersion relations and exact bounds on CFT correlators
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
The partitioning of constraints
The partitioning of constraints
Concise integer linear programming formulation for clique partitioning problems
A stepped tabu search method for the clique partitioning problem
Locally Exact Lower Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints
Cliquen
Exact BPS bound for noncommutative baby Skyrmions
Proteome partitioning constraints in long-term laboratory evolution
The exact distribution of the Hansen-Jagannathan bound
Dispersion relations and exact bounds on CFT correlators
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
The partitioning of constraints
The partitioning of constraints
Concise integer linear programming formulation for clique partitioning problems
A stepped tabu search method for the clique partitioning problem
Locally Exact Lower Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints
Cliquen
Exact BPS bound for noncommutative baby Skyrmions
Proteome partitioning constraints in long-term laboratory evolution
The exact distribution of the Hansen-Jagannathan bound