Search results
From MaRDI portal
- semidefinite programming based polyhedral cut and price approach for the maxcut problem 2006-09-28 Paper A unifying framework for several cutting plane methods...10 bytes (16 words) - 09:37, 25 September 2023
- unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem 2011-02-14 Paper A partition-based global optimization algorithm 2010-10-06...10 bytes (17 words) - 22:35, 10 December 2023
- linearly-constrained problems subject to simple bounds 2011-05-20 Paper An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem...10 bytes (16 words) - 06:48, 12 December 2023
- unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem 2011-02-14 Paper Nonmonotone globalization of the finite-difference...10 bytes (16 words) - 15:02, 12 December 2023
- design and scheduling (INDS) problem 2014-07-27 Paper P-hub approach for the optimal park-and-ride facility location problem 2014-07-27 Paper Using quadratic...10 bytes (18 words) - 14:35, 7 December 2023
- approximation results on graph matching and related problems 2024-01-05 Paper Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI...10 bytes (18 words) - 15:15, 13 December 2023
- elliptic boundary value problems 1995-05-22 Paper https://portal.mardi4nfdi.de/entity/Q4317306 1995-04-20 Paper ON NIRENBERG'S PROBLEM 1994-05-06 Paper Infinite...10 bytes (18 words) - 07:08, 9 December 2023
- Discrete warehouse problem 1997-02-28 Paper Sliceable Floorplanning by Graph Dualization 1995-07-03 Paper The pin redistribution problem in multi-chip modules...10 bytes (16 words) - 15:42, 12 December 2023
- optimization algorithm 2023-03-01 Paper Impact of graph structures for QAOA on maxcut 2023-02-22 Paper Empirical performance bounds for quantum approximate optimization...10 bytes (17 words) - 13:58, 6 October 2023
- 2011-12-16 Paper The chain graph sandwich problem 2011-11-17 Paper On the forbidden induced subgraph sandwich problem 2011-10-27 Paper Total chromatic number...10 bytes (22 words) - 10:24, 8 December 2023
- computational difficulty of the terminal connection problem 2023-05-25 Paper On the terminal connection problem 2022-03-24 Paper Computing the zig-zag number...10 bytes (20 words) - 12:12, 24 September 2023
- Subgraph Problem 2019-02-08 Paper Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP...10 bytes (16 words) - 19:03, 24 September 2023
- techniques for least squares problems in commutative quaternionic theory 2020-09-09 Paper Algebraic techniques for least squares problem over generalized quaternion...10 bytes (16 words) - 15:48, 10 December 2023
- spaces 2022-11-09 Paper Remarks on an edge-coloring problem 2022-04-27 Paper Rainbow Erdös--Rothschild Problem for the Fano Plane 2021-09-17 Paper Estimating...10 bytes (17 words) - 07:36, 9 December 2023
- Paper Asymptotics of the hypergraph bipartite Turán problem 2023-10-04 Paper New results for MaxCut in H$H$‐free graphs 2023-08-23 Paper The Turán number...10 bytes (16 words) - 22:22, 24 September 2023
- aspects of graph and hypergraph decomposition problems 2022-11-18 Paper The \(n\)-queens completion problem 2022-07-22 Paper An average degree condition...10 bytes (16 words) - 11:28, 6 October 2023
- Paper A generalized Turán problem and its applications 2019-08-22 Paper The removal lemma for tournaments 2019-06-17 Paper On MAXCUT in strictly supercritical...10 bytes (16 words) - 10:42, 7 October 2023
- Paper An Algorithm for Heilbronn's Problem 2000-10-18 Paper Depth efficient neural networks for division and related problems 2000-08-14 Paper Sparse 0−1 Matrices...10 bytes (16 words) - 11:08, 24 September 2023
- 2008-01-02 Paper Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring 2007-08-30 Paper Integer Programming and...10 bytes (17 words) - 18:19, 9 December 2023
- Subgraph Problem 2019-02-08 Paper Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP...10 bytes (17 words) - 09:50, 6 October 2023
