发布求助
文献互助 智能选刊 最新文献

International Symposium on Combinatorial Optimization最新文献

筛选
英文 中文
Lagrangean Decomposition for Mean-Variance Combinatorial Optimization 均值-方差组合优化的拉格朗日分解
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_6
F. Baumann, C. Buchheim, A. Ilyina
{"title":"Lagrangean Decomposition for Mean-Variance Combinatorial Optimization","authors":"F. Baumann, C. Buchheim, A. Ilyina","doi":"10.1007/978-3-319-09174-7_6","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_6","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115201394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting 带约束位置移动的飞机排序问题的状态空间简化动态规划
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_23
Fabio Furini, M. Kidd, A. Persiani, P. Toth
{"title":"State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting","authors":"Fabio Furini, M. Kidd, A. Persiani, P. Toth","doi":"10.1007/978-3-319-09174-7_23","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_23","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124205137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
The Envy-Free Pricing Problem and Unit-Demand Markets 无嫉妒定价问题与单位需求市场
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_20
Cristina G. Fernandes, C. Ferreira, Á. J. P. Franco, R. Schouery
{"title":"The Envy-Free Pricing Problem and Unit-Demand Markets","authors":"Cristina G. Fernandes, C. Ferreira, Á. J. P. Franco, R. Schouery","doi":"10.1007/978-3-319-09174-7_20","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_20","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114359319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
The Dominating Set Polytope via Facility Location 通过设施位置的支配集多面体
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_4
Mourad Baïou, F. Barahona
{"title":"The Dominating Set Polytope via Facility Location","authors":"Mourad Baïou, F. Barahona","doi":"10.1007/978-3-319-09174-7_4","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_4","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116928579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
The Computational Complexity of Stochastic Optimization 随机优化的计算复杂度
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_15
Cassio Polpo de Campos, G. Stamoulis, D. Weyland
{"title":"The Computational Complexity of Stochastic Optimization","authors":"Cassio Polpo de Campos, G. Stamoulis, D. Weyland","doi":"10.1007/978-3-319-09174-7_15","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_15","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123583678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Finding Totally Independent Spanning Trees with Linear Integer Programming 用线性整数规划求完全独立的生成树
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_13
A. S. Cunha, F. S. Souza
{"title":"Finding Totally Independent Spanning Trees with Linear Integer Programming","authors":"A. S. Cunha, F. S. Souza","doi":"10.1007/978-3-319-09174-7_13","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_13","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121594336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Proactive Reactive Scheduling in Resource Constrained Projects with Flexibility and Quality Robustness Requirements 具有灵活性和质量稳健性要求的资源约束项目的主动响应调度
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_10
Mario Brčič, D. Kalpić, Marija Katic
{"title":"Proactive Reactive Scheduling in Resource Constrained Projects with Flexibility and Quality Robustness Requirements","authors":"Mario Brčič, D. Kalpić, Marija Katic","doi":"10.1007/978-3-319-09174-7_10","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_10","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121687698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem 基于二次背包公式的最大均值离散问题混合启发式方法
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_16
F. D. Croce, Michele Garraffa, F. Salassa
{"title":"A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem","authors":"F. D. Croce, Michele Garraffa, F. Salassa","doi":"10.1007/978-3-319-09174-7_16","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_16","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125070865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Study of Identifying Code Polyhedra for Some Families of Split Graphs 若干分裂图族码多面体的识别研究
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_2
G. Argiroffo, S. Bianchi, Annegret K. Wagler
{"title":"Study of Identifying Code Polyhedra for Some Families of Split Graphs","authors":"G. Argiroffo, S. Bianchi, Annegret K. Wagler","doi":"10.1007/978-3-319-09174-7_2","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_2","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129550204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Vulnerability Assessment of Spatial Networks: Models and Solutions 空间网络脆弱性评估:模型与解决方案
International Symposium on Combinatorial Optimization Pub Date : 2014-03-05 DOI: 10.1007/978-3-319-09174-7_37
Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, E. Carrizosa, Francisco Pérez-Galarce
{"title":"Vulnerability Assessment of Spatial Networks: Models and Solutions","authors":"Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, E. Carrizosa, Francisco Pérez-Galarce","doi":"10.1007/978-3-319-09174-7_37","DOIUrl":"https://doi.org/10.1007/978-3-319-09174-7_37","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134159239","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信