摘要
研究对象是报纸的商业广告排版问题。将部分或全部待排商业广告指派到广告区域中,目标是广告之间不相互叠压地填满整个广告区域。首先根据问题的特点建立数学模型;然后运用两级分支定界算法对模型进行求解。仿真实验结果表明,该算法能快速地找到解,适合于实际应用。
The layout problem of business advertisements on newspapers is studied. The problem is characterized by that neither spare space nor overlap is allowed in a rectangle space for business advertisements in a newspaper. A model is established and solved by the two levels branch and band algorithm. A simulation result shows that the two levels branch and band algorithm provides better performance and is applicable in practice.
出处
《控制与决策》
EI
CSCD
北大核心
2003年第5期559-562,567,共5页
Control and Decision
关键词
商业广告
布局问题
分支定界算法
左下点
Business advertisement
Layout problem
Branch and Band algorithms
Left down point
