Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
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
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00186-023-00835-y
- URN
-
urn:nbn:de:101:1-2024010508022004176762
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:31 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Belyi, Alexander
- Sobolevsky, Stanislav
- Kurbatski, Alexander
- Ratti, Carlo
- SpringerLink (Online service)
Other Objects (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
Concise integer linear programming formulation for clique partitioning problems
The partitioning of constraints
The partitioning of constraints
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
Die Clique
Maliks Clique
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
Concise integer linear programming formulation for clique partitioning problems
The partitioning of constraints
The partitioning of constraints
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
Die Clique
Maliks Clique
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
Concise integer linear programming formulation for clique partitioning problems
The partitioning of constraints
The partitioning of constraints
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
Die Clique