咨询与建议

限定检索结果

文献类型

  • 80 篇 期刊文献
  • 12 篇 会议

馆藏范围

  • 92 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 56 篇 理学
    • 51 篇 数学
    • 3 篇 统计学(可授理学、...
    • 1 篇 地球物理学
    • 1 篇 地质学
    • 1 篇 生物学
    • 1 篇 系统科学
  • 53 篇 工学
    • 29 篇 计算机科学与技术...
    • 12 篇 电气工程
    • 8 篇 软件工程
    • 5 篇 信息与通信工程
    • 5 篇 控制科学与工程
    • 4 篇 力学(可授工学、理...
    • 2 篇 化学工程与技术
    • 2 篇 交通运输工程
    • 1 篇 机械工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 冶金工程
    • 1 篇 动力工程及工程热...
    • 1 篇 地质资源与地质工...
    • 1 篇 石油与天然气工程
  • 49 篇 管理学
    • 49 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 5 篇 经济学
    • 4 篇 应用经济学
    • 1 篇 理论经济学
  • 1 篇 农学
  • 1 篇 军事学

主题

  • 92 篇 cutting plane al...
  • 7 篇 integer programm...
  • 5 篇 facets
  • 4 篇 valid inequaliti...
  • 3 篇 youla parameteri...
  • 2 篇 switchbox routin...
  • 2 篇 traveling salesm...
  • 2 篇 clique inequalit...
  • 2 篇 support vector m...
  • 2 篇 separation probl...
  • 2 篇 mixed integer pr...
  • 2 篇 robust portfolio...
  • 2 篇 kernel methods
  • 2 篇 kyp lemma
  • 2 篇 sparse kernel me...
  • 2 篇 steiner tree pac...
  • 2 篇 lmi
  • 2 篇 mathematical pro...
  • 2 篇 unit commitment ...
  • 2 篇 graph theory

机构

  • 3 篇 univ s florida d...
  • 2 篇 tulane univ dept...
  • 2 篇 chuo univ dept i...
  • 2 篇 chinese acad sci...
  • 2 篇 cornell univ dep...
  • 2 篇 chinese acad sci...
  • 2 篇 bogazici univ de...
  • 2 篇 univ catholique ...
  • 1 篇 mcgill univ fac ...
  • 1 篇 natl univ singap...
  • 1 篇 conservatoire na...
  • 1 篇 southeast univ s...
  • 1 篇 soc gen f-92972 ...
  • 1 篇 univ lancaster d...
  • 1 篇 shanghai univ sc...
  • 1 篇 univ hong kong d...
  • 1 篇 univ augsburg in...
  • 1 篇 tu eindhoven dep...
  • 1 篇 univ lisboa fac ...
  • 1 篇 univ illinois de...

作者

  • 3 篇 grotschel m
  • 2 篇 marzi francesca
  • 2 篇 taskin z. caner
  • 2 篇 sehgal ruchika
  • 2 篇 konno h
  • 2 篇 zeng bo
  • 2 篇 constantino m
  • 2 篇 joachims thorste...
  • 2 篇 wang yang
  • 2 篇 li peishuai
  • 2 篇 vidyarthi navnee...
  • 2 篇 zhao long
  • 2 篇 neto jose
  • 2 篇 yu chun-nam john
  • 2 篇 wu zaijun
  • 2 篇 dou xiaobo
  • 2 篇 mehra aparna
  • 2 篇 jayaswal sachin
  • 2 篇 smriglio stefano
  • 2 篇 mcdonald nancy

语言

  • 84 篇 英文
  • 8 篇 其他
检索条件"主题词=cutting plane algorithm"
92 条 记 录,以下是1-10 订阅
排序:
A cutting plane algorithm FOR MINIMUM PERFECT 2-MATCHINGS
收藏 引用
COMPUTING 1987年 第4期39卷 327-344页
作者: GROTSCHEL, M HOLLAND, O UNIV BONN INST OPERAT RESD-5300 BONN 1FED REP GER
We describe an implementation of a cutting plane algorithm for the minimum weight perfect 2-matching problem. This algorithm is based on Edmonds' complete description of the perfect 2-matching polytope and uses th... 详细信息
来源: 评论
Multi-objective synthesis using LMI formulations for application of the cutting plane algorithm
收藏 引用
EUROPEAN JOURNAL OF CONTROL 2006年 第1期12卷 40-56页
作者: Abbas-Turki, Mohamed Duc, Gilles Clement, Benoit Dept Automat F-91192 Gif Sur Yvette France CNES Direct Lanceurs Pond Point Espace F-91023 Evry France
The problem of designing a controller to meet different specifications or deciding that no such controller exists is addressed in this paper by linking three types of tools: the Youla parameterization allows searching... 详细信息
来源: 评论
A nontangential cutting plane algorithm
收藏 引用
OPERATIONS RESEARCH LETTERS 2002年 第1期30卷 49-56页
作者: Lawphongpanich, S Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA
One method for solving the Lagrangian dual problem of a convex program is the cutting plane algorithm. Although this algorithm generally requires cuts that are tangential, or nearly so, to the dual function, this pape... 详细信息
来源: 评论
A faster cutting plane algorithm with accelerated line search for linear SVM
收藏 引用
PATTERN RECOGNITION 2017年 67卷 127-138页
作者: Chu, Dejun Zhang, Changshui Tao, Qing Tsinghua Univ Dept Automat State Key Lab Intelligent Technol & Syst Tsinghua Natl Lab Informat Sci & Technol TNList Beijing Peoples R China Army Officer Acad PLA Hefei Peoples R China
cutting plane algorithm (CPA) is a generalization of iterative first-order gradient method, in which the objective function is approximated successively by supporting hyperplanes. CPA has been tailored to solve regula... 详细信息
来源: 评论
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2021年 第1期291卷 67-83页
作者: Seker, Oylum Ekim, Tinaz Taskin, Z. Caner Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada Bogazici Univ Dept Ind Engn TR-34342 Istanbul Turkey
We consider the selective graph coloring problem, which is a generalization of the classical graph coloring problem. Given a graph together with a partition of its vertex set into clusters, we want to choose exactly o... 详细信息
来源: 评论
Bounding option prices by semidefinite programming: A cutting plane algorithm
收藏 引用
MANAGEMENT SCIENCE 2002年 第5期48卷 665-678页
作者: Gotoh, J Konno, H Univ Tsukuba Inst Policy & Planning Sci Tsukuba Ibaraki 3058573 Japan Chuo Univ Dept Ind & Syst Engn Bunkyo Ku Tokyo 1128551 Japan
In a recent article, Bertsimas and Popescu showed that a tight upper bound on a European-type call option price, given the first n moments of the distribution of the underlying security price, can be obtained by solvi... 详细信息
来源: 评论
A cutting plane algorithm for computing k-edge survivability of a network
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2004年 第3期156卷 579-589页
作者: Myung, YS Kim, HJ Dankook Univ Dept Business Adm Chungnam 330714 South Korea Univ Ulsan Dept Management Informat Syst Ulsan 680749 South Korea
Given an undirected network and a set of traffic demands between pairs of nodes, k-edge survivability of a given network is defined as the percentage of the total traffic surviving the failure of k edges in the worst ... 详细信息
来源: 评论
The Detection of Earnings Manipulation: The Three-Phase cutting plane algorithm Using Mathematical Programming
收藏 引用
JOURNAL OF FORECASTING 2010年 第5期29卷 442-466页
作者: Dikmen, Burcu Kucukkocaoglu, Guray Space Technol Res Inst Sci & Technol Res Council Turkey Ankara Turkey Baskent Univ Fac Econ & Adm Sci TR-06490 Ankara Turkey
The primary goal of this study was to propose an algorithm using mathematical programming to detect earnings management practices. In order to evaluate the ability of this proposed algorithm, the traditional statistic... 详细信息
来源: 评论
A simple finite cutting plane algorithm for integer programs
收藏 引用
OPERATIONS RESEARCH LETTERS 2012年 第6期40卷 578-580页
作者: Neto, Jose CNRS Samovar UMR 5157 Telecom SudParis Inst Mines Telecom F-91011 Evry France
A cutting plane algorithm is presented in order to solve linear integer programs in a finite number of iterations, under the assumption that the feasible region is bounded. The procedure also applies to the resolution... 详细信息
来源: 评论
A PRACTICAL GEOMETRICALLY CONVERGENT cutting plane algorithm
收藏 引用
SIAM JOURNAL ON NUMERICAL ANALYSIS 1995年 第2期32卷 631-644页
作者: DEMPSTER, MAH MERKOVSKY, RR DALHOUSIE UNIV DEPT MATH STAT & COMP SCIHALIFAXNS B3H 3J5CANADA PURDUE UNIV CALUMET DEPT MATH SCIHAMMONDIN 46323
In this paper we consider a practical variation of the Cheney-Goldstein-Kelley cutting plane algorithm which solves linear relaxations using the lexicographic dual simplex method and allows for the deletion of inactiv... 详细信息
来源: 评论