放逐
发表于 2025-3-30 11:02:09
Cuts for Conic Mixed-Integer Programmingly incorporated in branch-and-bound algorithms that solve continuous conic programming relaxations at the nodes of the search tree. Our preliminary computational experiments with the new cuts show that they are quite effective in reducing the integrality gap of continuous relaxations of conic mixed-integer programs.
Ischemia
发表于 2025-3-30 15:38:36
http://reply.papertrans.cn/47/4683/468248/468248_52.png
不可接触
发表于 2025-3-30 18:44:49
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract) above problem. Our system requires the use of a type of comb inequality (introduced by Grötschel and Padberg for the TSP polytope) that has {0,1,2}-coefficients and hence is more general than the well-known blossom inequality used in Edmonds’ characterization of the simple 2-matching polytope.
供过于求
发表于 2025-3-30 22:29:26
http://reply.papertrans.cn/47/4683/468248/468248_54.png
Organization
发表于 2025-3-31 01:05:28
On a Generalization of the Master Cyclic Group Polyhedrontain facet defining inequalities for the MEP, and also present facet defining inequalities for the MEP that cannot be obtained in such a way. Finally, we study the mixed-integer extension of the MEP and present an interpolation theorem that produces valid inequalities for general Mixed Integer Programming Problems using facets of the MEP.
轻率的你
发表于 2025-3-31 07:09:34
http://reply.papertrans.cn/47/4683/468248/468248_56.png
ABYSS
发表于 2025-3-31 10:03:34
Inequalities from Two Rows of a Simplex TableauIn this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice point free bodies and the derivation of inequalities for mixed integer linear programs by considering two rows of a simplex tableau simultaneously.
灌输
发表于 2025-3-31 16:32:44
http://reply.papertrans.cn/47/4683/468248/468248_58.png
EVICT
发表于 2025-3-31 19:42:58
A Faster Strongly Polynomial Time Algorithm for Submodular Function MinimizationWe consider the problem of minimizing a submodular function .defined on a set . with . elements. We give a combinatorial algorithm that runs in O(.. EO + ..) time, where EO is the time to evaluate .(.) for some . ⊆ .. This improves the previous best strongly polynomial running time by more than a factor of .