咨询与建议

限定检索结果

文献类型

  • 259 篇 期刊文献
  • 26 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 261 篇 理学
    • 259 篇 数学
    • 3 篇 统计学(可授理学、...
  • 156 篇 管理学
    • 156 篇 管理科学与工程(可...
    • 8 篇 工商管理
  • 105 篇 工学
    • 58 篇 软件工程
    • 52 篇 计算机科学与技术...
    • 2 篇 电气工程
    • 2 篇 控制科学与工程
    • 2 篇 石油与天然气工程
    • 1 篇 信息与通信工程
  • 11 篇 经济学
    • 11 篇 应用经济学
  • 1 篇 教育学
    • 1 篇 心理学(可授教育学...

主题

  • 287 篇 polyhedral combi...
  • 39 篇 integer programm...
  • 26 篇 combinatorial op...
  • 26 篇 branch-and-cut
  • 22 篇 facets
  • 13 篇 cutting planes
  • 9 篇 valid inequaliti...
  • 9 篇 stable set polyt...
  • 8 篇 traveling salesm...
  • 8 篇 mixed-integer pr...
  • 8 篇 max-cut problem
  • 7 篇 linear programmi...
  • 7 篇 facet
  • 7 篇 lot-sizing
  • 6 篇 polytopes
  • 6 篇 matching
  • 6 篇 extended formula...
  • 6 篇 scheduling
  • 5 篇 graph partitioni...
  • 5 篇 separation

机构

  • 9 篇 univ lancaster d...
  • 8 篇 univ lancaster d...
  • 7 篇 univ lancaster d...
  • 5 篇 georgia inst tec...
  • 4 篇 univ lancaster s...
  • 4 篇 king saud univ d...
  • 4 篇 consejo nacl inv...
  • 3 篇 univ bonn inst o...
  • 3 篇 consejo nacl inv...
  • 3 篇 univ patras dept...
  • 3 篇 texas tech univ ...
  • 3 篇 univ estadual ca...
  • 3 篇 konrad zuse zent...
  • 3 篇 sciences institu...
  • 3 篇 konrad zuse zent...
  • 3 篇 univ london lond...
  • 3 篇 natl univ gen sa...
  • 3 篇 univ bologna i-4...
  • 3 篇 univ cologne ins...
  • 3 篇 univ politecn va...

作者

  • 27 篇 letchford adam n...
  • 16 篇 marenco javier
  • 7 篇 reinelt gerhard
  • 6 篇 bianchi s.
  • 6 篇 barahona f
  • 6 篇 sorensen michael...
  • 6 篇 mahjoub ar
  • 5 篇 kaparis konstant...
  • 5 篇 grotschel m
  • 5 篇 fischer anja
  • 5 篇 balas e
  • 4 篇 labbe martine
  • 4 篇 ventura paolo
  • 4 篇 fischer frank
  • 4 篇 souli georgia
  • 4 篇 oswald marcus
  • 4 篇 magos d.
  • 4 篇 koster arie m. c...
  • 4 篇 escalante m.
  • 4 篇 de souza cc

语言

  • 249 篇 英文
  • 37 篇 其他
  • 1 篇 中文
检索条件"主题词=Polyhedral combinatorics"
287 条 记 录,以下是1-10 订阅
排序:
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
收藏 引用
MATHEMATICAL PROGRAMMING 2025年 第1-2期210卷 97-146页
作者: Buesing, Christina Gersing, Timo Koster, Arie M. C. A. Univ Klinikum RWTH Aachen Klin Unfall & Wiederherstellungsch D-52074 Aachen Germany Rhein Westfal TH Aachen Discrete Optimizat Pontdriesch 10-12 D-52062 Aachen Germany
Robust combinatorial optimization with budgeted uncertainty is one of the most popular approaches for integrating uncertainty into optimization problems. The existence of a compact reformulation for (mixed-integer) li... 详细信息
来源: 评论
Information Theory and polyhedral combinatorics
Information Theory and Polyhedral Combinatorics
收藏 引用
Annual Allerton Conference on Communication, Control, and Computing
作者: Sebastian Pokutta the H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta GA.
The theory of extended formulations is concerned with the optimal polyhedral representation of a (combinatorial) optimization problem. In this context, information-theoretic methods recently gained significant attenti... 详细信息
来源: 评论
New facets of the clique partitioning polytope
收藏 引用
OPERATIONS RESEARCH LETTERS 2025年 59卷
作者: Letchford, Adam N. Sorensen, Michael M. Univ Lancaster Dept Management Sci Lancaster LA1 4YW England Aarhus Univ Dept Econ & Business Econ Fuglesangs Allee 4 DK-8210 Aarhus V Denmark
The clique partitioning problem is a combinatorial optimisation problem which has many applications. At present, the most promising exact algorithms are those that are based on an understanding of the associated polyt... 详细信息
来源: 评论
Cuts and semidefinite liftings for the complex cut polytope
收藏 引用
MATHEMATICAL PROGRAMMING 2024年 1-50页
作者: Sinjorgo, Lennart Sotirov, Renata Anjos, Miguel F. Tilburg Univ Dept Econometr & OR Tilburg Netherlands Univ Edinburgh Sch Math Edinburgh Scotland
We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices xx(H), where the elements of x is an element of C-n aremth unit roots. These polytopes have appli-cations in MAX-3-CUT, digital commun... 详细信息
来源: 评论
polyhedral approach to weighted connected matchings in general graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2024年 359卷 143-152页
作者: Samer, Phillippe Moura, Phablo F. S. Univ Bergen Inst Informatikk Postboks 7800 N-5020 Bergen Norway Katholieke Univ Leuven Res Ctr Operat Res & Stat Leuven Belgium
A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G . While finding a connected matching of maximum cardinality is a well-solved probl... 详细信息
来源: 评论
Optimizing over path-length matrices of unrooted binary trees
收藏 引用
MATHEMATICAL PROGRAMMING 2025年 1-53页
作者: Catanzaro, Daniele Pesenti, Raffaele Sapucaia, Allan Wolsey, Laurence Catholic Univ Louvain Ctr Operat Res & Econometr Voie Roman Pays 34 B-1348 Louvain la Neuve Belgium Univ CaFoscari Dept Management San GiobbeCannaregio 837 I-30121 Venice Italy
Path-Length Matrices (PLMs) form a tree encoding scheme that is often used in the context of optimization problems defined over Unrooted Binary Trees (UBTs). Determining the conditions that a symmetric integer matrix ... 详细信息
来源: 评论
Integer programming models and polyhedral study for the geodesic classification problem on graphs
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2024年 第3期314卷 894-911页
作者: Araujo, Paulo H. M. Campelo, Manoel Correa, Ricardo C. Labbe, Martine Univ Fed Ceara Quixada Brazil Univ Fed Ceara Fortaleza Brazil Univ Fed Rural Rio de Janeiro Nova Iguacu Brazil Free Univ Brussels Brussels Belgium
We study a discrete version of the classical classification problem in Euclidean space, to be called the geodesic classification problem. It is defined on a graph, where some vertices are initially assigned a class an... 详细信息
来源: 评论
Rigidity of Nonconvex Polyhedra with Respect to Edge Lengths and Dihedral Angles
收藏 引用
DISCRETE & COMPUTATIONAL GEOMETRY 2024年 1-35页
作者: Cho, Yunhi Kim, Seonhwa Univ Seoul Dept Math Seoul 02504 South Korea Korea Inst Adv Study Seoul 02455 South Korea
We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron ha... 详细信息
来源: 评论
Multilinear sets with two monomials and cardinality constraints
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 324卷 67-79页
作者: Chen, Rui Dash, Sanjeeb Gunluk, Oktay Cornell Tech New York NY 10044 USA IBM Res Armonk NY USA Cornell Univ Ithaca NY 14853 USA
Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid inequalities for the multilinear set a... 详细信息
来源: 评论
Formulations and valid inequalities for the capacitated dispersion problem
收藏 引用
NETWORKS 2023年 第2期81卷 294-315页
作者: Landete, Mercedes Peiro, Juanjo Yaman, Hande Univ Miguel Hernandez Elche Inst Ctr Invest Operat Dept Estadist Matemat & Informat Elche Spain Univ Valencia Fac Ciencies Matemat Dept Estadist & Invest Operat Valencia Spain Katholieke Univ Leuven Res Ctr Operat Res & Business Stat ORSTAT Fac Econ & Business Leuven Belgium
This work focuses on the capacitated dispersion problem for which we study several mathematical formulations in different spaces using variables associated with nodes, edges, and costs. The relationships among the pre... 详细信息
来源: 评论