位置：成果数据库 > 期刊 > 期刊详情页
Machine scheduling with contiguous processing constraints
  • ISSN号：0020-0190
  • 期刊名称：Information Processing Letters
  • 时间：2013.4.30
  • 页码：280-284
  • 相关项目：图的匹配理论的多面体方法
作者： Lin, Lan|Lin, Yixun|
同期刊论文项目
图的匹配理论的多面体方法
期刊论文 31
同项目期刊论文
Minimum Dominating Tree Problem for Graphs
<span style="font-family:'Times New Roman';font-size:12pt;">A characteriza
Cutwidth of triangular grids
Cutwidth of iterated caterpillars
有负荷约束的指派问题
最小饱和流问题的多项式时间可解变形(英文)
网络最小覆盖流问题
PM-紧邻二部图和几乎二部图的刻画
关于小维数完美匹配多面体的三匹配交猜想
New Classes of Extremal Graphs with Given Bandwidth
关于极大二部匹配可扩图
On the vertex-arboricity of K-5-minor-free graphs of diameter 2
<span style="font-family:'Times New Roman';font-size:12pt;">A note on PM-c
<span class="title">New Classes of Extremal Graphs with Given Bandwidth</span>
On Graphs with a Unique Perfect Matching
关于二部匹配可扩图的一个注记
Three-matching intersection conjecture for perfect matching polytopes of small dimensions
<span class="title"><span class="title">Batching machine scheduling
4-regular bipartite matching extendable graphs
The Interval Graph Completion Problem on Split Graphs
Bicriteria Scheduling on a Series-Batching Machine to Minimize Makespan and Total Weighted Completion Time with Equal Length Job
最小饱和流问题的多项式时间可解变形