咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 45 篇 工学
    • 22 篇 计算机科学与技术...
    • 17 篇 交通运输工程
    • 13 篇 土木工程
    • 6 篇 电气工程
    • 2 篇 机械工程
    • 2 篇 控制科学与工程
    • 1 篇 信息与通信工程
    • 1 篇 化学工程与技术
    • 1 篇 航空宇航科学与技...
  • 41 篇 管理学
    • 41 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 16 篇 经济学
    • 12 篇 理论经济学
    • 4 篇 应用经济学
  • 12 篇 理学
    • 12 篇 数学
    • 1 篇 统计学(可授理学、...
  • 1 篇 军事学

主题

  • 62 篇 branch-and-price...
  • 13 篇 column generatio...
  • 5 篇 integer programm...
  • 5 篇 robust optimizat...
  • 4 篇 routing
  • 4 篇 scheduling
  • 4 篇 vehicle routing ...
  • 3 篇 electric vehicle...
  • 3 篇 tabu search
  • 3 篇 graph coloring
  • 3 篇 heuristic algori...
  • 2 篇 demand uncertain...
  • 2 篇 logistics
  • 2 篇 public transport...
  • 2 篇 bin packing prob...
  • 2 篇 dantzig-wolfe de...
  • 2 篇 optimization
  • 2 篇 stochastic progr...
  • 2 篇 vertex coloring
  • 2 篇 vehicle routing

机构

  • 8 篇 beihang univ sch...
  • 3 篇 beijing jiaotong...
  • 3 篇 ecole polytech d...
  • 3 篇 univ brescia dep...
  • 2 篇 ecole hautes etu...
  • 2 篇 tongji univ sch ...
  • 2 篇 northeastern uni...
  • 2 篇 beihang univ key...
  • 2 篇 beijing jiaotong...
  • 2 篇 univ brescia dep...
  • 2 篇 hefei univ techn...
  • 2 篇 natl univ singap...
  • 1 篇 polish acad sci ...
  • 1 篇 univ elect sci &...
  • 1 篇 hefei univ techn...
  • 1 篇 univ sorbonne pa...
  • 1 篇 univ wisconsin s...
  • 1 篇 katholieke univ ...
  • 1 篇 korea adv inst s...
  • 1 篇 beijing jiaotong...

作者

  • 6 篇 yu bin
  • 5 篇 zhang li
  • 4 篇 furini fabio
  • 3 篇 bianchessi nicol...
  • 3 篇 archetti claudia
  • 3 篇 liu zhongshan
  • 3 篇 hertz alain
  • 3 篇 he shiwei
  • 3 篇 chi jushang
  • 2 篇 malaguti enrico
  • 2 篇 calvo roberto wo...
  • 2 篇 gao ziyou
  • 2 篇 gao yuan
  • 2 篇 zhou yu
  • 2 篇 xiao wei
  • 2 篇 yang lixing
  • 2 篇 chen feng
  • 2 篇 chen tingting
  • 1 篇 chen qianqian
  • 1 篇 park sungsoo

语言

  • 53 篇 英文
  • 8 篇 其他
  • 1 篇 德文
  • 1 篇 法文
检索条件"主题词=Branch-and-Price algorithm"
62 条 记 录,以下是51-60 订阅
排序:
An exact algorithm for the Partition Coloring Problem
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2018年 92卷 170-181页
作者: Furini, Fabio Malaguti, Enrico Santini, Alberto PSL Res Univ Univ Paris Dauphine CNRS F-75016 Paris France Univ Bologna DEI I-40136 Bologna Italy Univ Pompeu Fabra Dept Econ & Empresa Barcelona Spain Barcelona GSE Barcelona Spain
We study the Partition Coloring Problem (PCP), a generalization of the Vertex Coloring Problem where the vertex set is partitioned. The PCP asks to select one vertex for each subset of the partition in such a way that... 详细信息
来源: 评论
The multi-terminal vertex separator problem: Complexity, Polyhedra and algorithms
The multi-terminal vertex separator problem: Complexity, Pol...
收藏 引用
作者: Youcef Magnouche PSL Research University
学位级别:博士
This thesis deals with the multi-terminal vertex separator problem. Given a graph G = (V ∪T, E) with V ∪T the set of vertices, where T is a set of terminals, and a weight function w: V → Z, associated with nontermi... 详细信息
来源: 评论
An integer programming approach to the bloodmobile routing problem
收藏 引用
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2016年 第Feb.期86卷 94-115页
作者: Gunpinar, Serkan Centeno, Grisselle Univ S Florida Dept Ind & Management Syst Engn 4202 E Fowler Ave Tampa FL 33620 USA
Every day, a blood center must determine a set of locations among a group of potential sites to route their vehicles for blood collection so as to avoid shortfalls. In this study, a vehicle routing problem is modeled ... 详细信息
来源: 评论
On the Design of Complex Networks through a branch-and-price algorithm
On the Design of Complex Networks through a Branch-and-Price...
收藏 引用
Globecom Workshops
作者: Souza, Fernanda S. H. Cunha, Alexandre S. Mateus, Geraldo R. Univ Fed Minas Gerais Dept Comp Sci Belo Horizonte MG Brazil
In this paper, we present a branch-and-price algorithm for solving the Optimal Topology Design Problem of complex networks, based on a tightened deterministic formulation for the problem. The algorithm, which incorpor... 详细信息
来源: 评论
Directed weighted improper coloring for cellular channel allocation
收藏 引用
DISCRETE APPLIED MATHEMATICS 2015年 182卷 46-60页
作者: Archetti, Claudia Bianchessi, Nicola Hertz, Alain Colombet, Adrien Gagnon, Francois Univ Brescia Dept Quantitat Methods Brescia Italy Univ Brescia Dept Informat Engn Brescia Italy Ecole Polytech Dept Math & Ind Engn Montreal PQ H3C 3A7 Canada Ecole Hautes Etud Commerciales Gerad Montreal PQ Canada Ecole Technol Super Dept Elect Engn Montreal PQ Canada
Given a directed graph with weights on the vertices and on the arcs, a theta-improper k-coloring is an assignment of at most k different colors to the vertices of G such that the weight of every vertex nu is greater, ... 详细信息
来源: 评论
Incomplete Service and Split Deliveries in a Routing Problem with Profits
收藏 引用
NETWORKS 2014年 第2期63卷 135-145页
作者: Archetti, Claudia Bianchessi, Nicola Speranza, M. Grazia Hertz, Alain Univ Brescia Dept Quantitat Methods Brescia Italy Ecole Polytech Dept Math & Ind Engn Montreal PQ H3C 3A7 Canada HEC Gerad Montreal PQ Canada
In this article, we study a variant of the capacitated team orienteering problem, that is the problem where a fleet of vehicles, each with a constraint on the time available, is given to serve profitable customers wit... 详细信息
来源: 评论
A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
收藏 引用
OR SPECTRUM 2008年 第3期30卷 515-534页
作者: Sun, Dong-Seok Lee, Tae-Eog Korea Adv Inst Sci & Technol Dept Ind Engn Taejon 305701 South Korea Samsung Elect Syst Engn Team Taean Eup Hwasung City Geonggi Do South Korea
We develop a branch-and-price procedure for a placement routing problem for a multi-head beam-type component placement tool. The problem is modelled as an integer programming model with a huge number of variables, eac... 详细信息
来源: 评论
A branch-and-price approach for the partition coloring problem
收藏 引用
OPERATIONS RESEARCH LETTERS 2011年 第2期39卷 132-137页
作者: Hoshino, Edna A. Frota, Yuri A. de Souza, Cid C. Univ Estadual Campinas Inst Comp BR-13083852 Campinas SP Brazil Univ Fed Mato Grosso do Sul Fac Comp Campo Grande Brazil Univ Fed Fluminense Dept Comp Sci Niteroi RJ Brazil
This work proposes a new integer programming model for the partition coloring problem and a branch-and-price algorithm to solve it. Experiments are reported for random graphs and instances originating from routing and... 详细信息
来源: 评论
Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2011年 第3期210卷 670-683页
作者: Nobibon, Fabrice Talla Leus, Roe Spieksma, Frits C. R. Katholieke Univ Leuven Operat Res Grp B-3000 Louvain Belgium
This paper presents an optimization model for the selection of sets of clients that will receive an offer for one or more products during a promotion campaign. We show that the problem is strongly NP-hard and that it ... 详细信息
来源: 评论
A branch-and-price algorithm for multistage stochastic integer programming with application to stochastic batch-sizing problems
收藏 引用
MANAGEMENT SCIENCE 2004年 第6期50卷 786-796页
作者: Lulli, G Sen, S Univ Arizona Dept Syst & Ind Engn Tucson AZ 85721 USA
In this paper, we present. a branch-and-price method to solve special structured multistage stochastic integer programming problems: We validate our method on two different versions of a multistage stochastic batchsiz... 详细信息
来源: 评论