MAX-CUT

作品数：4被引量：0H指数：0
导出分析报告
相关作者：刘田彭瀚李鑫孙宏涛朱嘉奇更多>>
相关机构：北京大学更多>>
相关期刊：《Journal of the Operations Research Society of China》《Science China(Information Sciences)》《Journal of Computational Mathematics》《Acta Mathematica Sinica,English Series》更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划福建省自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-4
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
20736-node weighted max-cut problem solving by quadrature photonic spatial Ising machine
《Science China(Information Sciences)》2023年第12期285-286,共2页Xin YE Wenjia ZHANG Shaomeng WANG Xiaoxuan YANG Zuyuan HE 
supported by National Key Research and Development Program of China (Grant No.2019YFB1802903);National Natural Science Foundation of China (Grant Nos.62175146,62235011);Major Key Project of PCL (Grant No.PCL2021A14)。
The max-cut problem is one of the fundamental NP-hard problems in combinatorial optimization,which can describe the practical applications such as data clustering,machine scheduling,and image recognition.This problem ...
关键词：problem optimization image 
Biased Partitions and Judicious k-Partitions of Graphs
《Acta Mathematica Sinica,English Series》2017年第5期668-680,共13页Qing Hou ZENG Jian Feng HOU Jin DENG Xia LEI 
Supported by NSFC(Grant No.11671087);New Century Programming of Fujian Province(Grant No.JA14028)
Let G =（V, E） be a graph with m edges. For reals p ∈ [0, 1] and q = 1-p, let m;（G） be the minimum of qe（V;） + pe（V;） over partitions V = V;∪ V;, where e（V;） denotes the number of edges spanned by V;. We sh...
关键词：GRAPH MAX-CUT biased partition judicious partition 
Combining Clustered Adaptive Multistart and Discrete Dynamic Convexized Method for the Max-Cut Problem
《Journal of the Operations Research Society of China》2014年第2期237-262,共26页Geng Lin Wenxing Zhu 
supported partially by the National Natural Science Foundation of China(Nos.11226236 and 11301255);the Natural Science Foundation of Fujian Province of China(No.2012J05007);the Science and Technology Project of the Education Bureau of Fujian,China(Nos.JA13246 and JK2012037).
Given an undirected graph with edge weights,the max-cut problem is to find a partition of the vertices into twosubsets,such that the sumof theweights of the edges crossing different subsets ismaximized.Heuristics base...
关键词：MAX-CUT Local search Dynamic convexized method Clustered adaptive multistart 
AN EFFECTIVE CONTINUOUS ALGORITHM FOR APPROXIMATE SOLUTIONS OF LARGE SCALE MAX-CUT PROBLEMS
《Journal of Computational Mathematics》2006年第6期749-760,共12页Cheng-xian Xu Xiao-liang Feng-min Xu 
This work is supported by National Natural Science Foundation of China at 10231060.
An effective continuous algorithm is proposed to find approximate solutions of NP-hard max-cut problems. The algorithm relaxes the max-cut problem into a continuous nonlinear programming problem by replacing n discret...
关键词：Max-cut problems ALGORITHM Feasible direction method Laplacian matrix Eigenvectors. 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部