相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Exact solution of network flow models with strong relaxations
Vinicius Loti de Lima et al.
MATHEMATICAL PROGRAMMING (2023)
Arc flow formulations based on dynamic programming: Theoretical foundations and applications
Vinicius L. de Lima et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)
Improved flow-based formulations for the skiving stock problem
J. Martinovic et al.
COMPUTERS & OPERATIONS RESEARCH (2020)
Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
Danni Wang et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2020)
Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
Maxence Delorme et al.
INFORMS JOURNAL ON COMPUTING (2020)
A heuristic for the skiving and cutting stock problem in paper and plastic film industries
Yan Chen et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2019)
A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
J. Martinovic et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)
Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
John Martinovic et al.
OPTIMIZATION (2018)
Integer Linear Programming Formulations for Cognitive Radio Resource Allocation
John Martinovic et al.
IEEE WIRELESS COMMUNICATIONS LETTERS (2017)
Bin packing and related problems: General arc-flow formulation with graph compression
Filipe Brandao et al.
COMPUTERS & OPERATIONS RESEARCH (2016)
Integer rounding and modified integer rounding for the skiving stock problem
J. Martinovic et al.
DISCRETE OPTIMIZATION (2016)
Integer linear programming models for the skiving stock problem
J. Martinovic et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
Bin packing and cutting stock problems: Mathematical models and exact algorithms
Maxence Delorme et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
The proper relaxation and the proper gap of the skiving stock problem
John Martinovic et al.
MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2016)
Dual Inequalities for Stabilized Column Generation Revisited
Timo Gschwind et al.
INFORMS JOURNAL ON COMPUTING (2016)
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
Vadim M. Kartak et al.
DISCRETE APPLIED MATHEMATICS (2015)
Friendly bin packing instances without Integer Round-up Property
Alberto Caprara et al.
MATHEMATICAL PROGRAMMING (2015)
Spectrum Assignment in Cognitive Radio Networks: A Comprehensive Survey
Elias Z. Tragos et al.
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS (2013)
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
Stefan Irnich et al.
INFORMS JOURNAL ON COMPUTING (2010)
Dual-optimal inequalities for stabilized column generation
Hatem Ben Amor et al.
OPERATIONS RESEARCH (2006)
Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
M Peeters et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
A hybrid improvement heuristic for the one-dimensional bin packing problem
ACF Alvim et al.
JOURNAL OF HEURISTICS (2004)
Cutting and reuse: An application from automobile component manufacturing
C Arbib et al.
OPERATIONS RESEARCH (2002)
A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
G Belov et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
Benchmarking optimization software with performance profiles
ED Dolan et al.
MATHEMATICAL PROGRAMMING (2002)
分享论文
