咨询与建议

限定检索结果

文献类型

  • 23 篇 期刊文献
  • 2 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 16 篇 管理学
    • 16 篇 管理科学与工程(可...
    • 3 篇 工商管理
  • 14 篇 理学
    • 14 篇 数学
  • 11 篇 工学
    • 8 篇 计算机科学与技术...
    • 2 篇 化学工程与技术
    • 1 篇 电气工程
    • 1 篇 交通运输工程
    • 1 篇 软件工程
  • 3 篇 经济学
    • 3 篇 应用经济学

主题

  • 26 篇 branch-and-cut a...
  • 6 篇 combinatorial op...
  • 5 篇 integer programm...
  • 3 篇 benders decompos...
  • 3 篇 polyhedral combi...
  • 2 篇 decomposition he...
  • 2 篇 conic integer pr...
  • 2 篇 angular constrai...
  • 2 篇 integer linear p...
  • 2 篇 mixed-integer no...
  • 1 篇 integer linear p...
  • 1 篇 traveling salesm...
  • 1 篇 separation
  • 1 篇 convex and bipar...
  • 1 篇 submodular funct...
  • 1 篇 2-connected grap...
  • 1 篇 supermodularity
  • 1 篇 stable set
  • 1 篇 gomory cuts
  • 1 篇 routing

机构

  • 3 篇 univ fed minas g...
  • 2 篇 mit dept chem en...
  • 2 篇 univ calif berke...
  • 1 篇 univ fed rio de ...
  • 1 篇 ecole hautes etu...
  • 1 篇 simon fraser uni...
  • 1 篇 ecole polytech m...
  • 1 篇 univ buenos aire...
  • 1 篇 essec business s...
  • 1 篇 indian inst tech...
  • 1 篇 univ bologna dei...
  • 1 篇 instituto de cie...
  • 1 篇 univ fed minas g...
  • 1 篇 univ lisbon fac ...
  • 1 篇 univ fed rio de ...
  • 1 篇 univ fed rio de ...
  • 1 篇 sandia natl labs...
  • 1 篇 univ padua dei v...
  • 1 篇 univ padua dei p...
  • 1 篇 programa de enge...

作者

  • 5 篇 da cunha alexand...
  • 5 篇 lucena abilio
  • 3 篇 atamtuerk alper
  • 2 篇 narayanan vishnu
  • 2 篇 fischetti m
  • 2 篇 pereira dilson l...
  • 2 篇 kesavan p
  • 2 篇 barton pi
  • 1 篇 simonetti luidi
  • 1 篇 toth p
  • 1 篇 marcelo bianchet...
  • 1 篇 maculan nelson
  • 1 篇 louveaux quentin
  • 1 篇 guo zhaomiao
  • 1 篇 toth paolo
  • 1 篇 fortz bernard
  • 1 篇 bianchetti marce...
  • 1 篇 monaci michele
  • 1 篇 audet c.
  • 1 篇 weismantel rober...

语言

  • 22 篇 英文
  • 4 篇 其他
检索条件"主题词=Branch-and-Cut algorithms"
26 条 记 录,以下是21-30 订阅
排序:
A branch-and-cut algorithm for Graph Coloring
收藏 引用
DISCRETE APPLIED MATHEMATICS 2006年 第5期154卷 826-847页
作者: Méndez-Díaz, I Zabala, P Univ Buenos Aires FCEyN Dept Computac RA-1053 Buenos Aires DF Argentina
In this paper a branch-and-cut algorithm, based on a formulation previously introduced by us, is proposed for the Graph Coloring Problem. Since colors are indistinguishable in graph coloring, there may typically exist... 详细信息
来源: 评论
Some formulations for the group steiner tree problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2006年 第13期154卷 1877-1884页
作者: Ferreira, Carlos E. de Oliveira Filho, Fernando M. Univ Sao Paulo Inst Math & Stat Dept Comp Sci Sao Paulo Brazil
The group Steiner tree problem consists of, given a graph G, a collection M of subsets of V (G) and a cost c(e) for each edge of G, finding a minimum-cost subtree that connects at least one vertex from each R is an el... 详细信息
来源: 评论
Solving the cell suppression problem on tabular data with linear constraints
收藏 引用
MANAGEMENT SCIENCE 2001年 第7期47卷 1008-1027页
作者: Fischetti, M Salazar, JJ Univ Padua DEI Padua Italy Univ La Laguna DEIOC E-38207 La Laguna Spain
Cell suppression is a widely used technique for protecting sensitive information in statistical data presented in tabular form. Previous works on the subject mainly concentrate on 2- and 3-dimensional tables whose ent... 详细信息
来源: 评论
Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems
收藏 引用
COMPUTERS & CHEMICAL ENGINEERING 2000年 第2-7期24卷 1361-1366页
作者: Kesavan, P Barton, PI MIT Dept Chem Engn Cambridge MA 02139 USA
branch and bound (BB) is the primary deterministic approach that has been applied successfully to solve mixed-integer nonlinear programming (MINLPs) problems in which the participating functions are nonconvex. Recentl... 详细信息
来源: 评论
Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems
Generalized branch-and-cut framework for mixed-integer nonli...
收藏 引用
7th International Symposium on Process Systems Engineering
作者: Kesavan, P Barton, PI MIT Dept Chem Engn Cambridge MA 02139 USA
branch and bound (BB) is the primary deterministic approach that has been applied successfully to solve mixed-integer nonlinear programming (MINLPs) problems in which the participating functions are nonconvex. Recentl... 详细信息
来源: 评论
A polyhedral approach to the asymmetric traveling salesman problem
收藏 引用
MANAGEMENT SCIENCE 1997年 第11期43卷 1520-1536页
作者: Fischetti, M Toth, P UNIV BOLOGNA DEISBOLOGNAITALY
Several branch-and-bound algorithms for the exact solution of the asymmetric traveling salesman problem (ATSP), based on the assignment problem (AP) relaxation, have been proposed in the literature. These algorithms p... 详细信息
来源: 评论