Search dblp for Publications

export results for "toc:db/journals/anor/anor139.bht:"

 download as .bib file

@article{DBLP:journals/anor/Atamturk05,
  author       = {Alper Atamt{\"{u}}rk},
  title        = {Cover and Pack Inequalities for (Mixed) Integer Programming},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {21--38},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3442-1},
  doi          = {10.1007/S10479-005-3442-1},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Atamturk05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/ContesseFM05,
  author       = {Luis Contesse and
                  Juan{-}Carlos Ferrer and
                  Sergio Maturana},
  title        = {A Mixed-Integer Programming Model for Gas Purchase and Transportation},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {39--63},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3443-0},
  doi          = {10.1007/S10479-005-3443-0},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/ContesseFM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/DreznerHT05,
  author       = {Zvi Drezner and
                  Peter M. Hahn and
                  {\'{E}}ric D. Taillard},
  title        = {Recent Advances for the Quadratic Assignment Problem with Special
                  Emphasis on Instances that are Difficult for Meta-Heuristic Methods},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {65--94},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3444-z},
  doi          = {10.1007/S10479-005-3444-Z},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/DreznerHT05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/EcksteinN05,
  author       = {Jonathan Eckstein and
                  Mikhail Nediak},
  title        = {Depth-Optimized Convexity Cuts},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {95--129},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3445-y},
  doi          = {10.1007/S10479-005-3445-Y},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/anor/EcksteinN05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/FloudasL05,
  author       = {Christodoulos A. Floudas and
                  Xiaoxia Lin},
  title        = {Mixed Integer Linear Programming in Process Scheduling: Modeling,
                  Algorithms, and Applications},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {131--162},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3446-x},
  doi          = {10.1007/S10479-005-3446-X},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/FloudasL05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Frangioni05,
  author       = {Antonio Frangioni},
  title        = {About Lagrangian Methods in Integer Optimization},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {163--193},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3447-9},
  doi          = {10.1007/S10479-005-3447-9},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Frangioni05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/FrevilleH05,
  author       = {Arnaud Fr{\'{e}}ville and
                  Sa{\"{\i}}d Hanafi},
  title        = {The Multidimensional 0-1 Knapsack Problem - Bounds and Computational
                  Aspects},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {195--227},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3448-8},
  doi          = {10.1007/S10479-005-3448-8},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/FrevilleH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Guignard-SpielbergS05a,
  author       = {Monique Guignard{-}Spielberg and
                  Kurt Spielberg},
  title        = {Preface},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {17--20},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3441-2},
  doi          = {10.1007/S10479-005-3441-2},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Guignard-SpielbergS05a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/KochenbergerGAR05,
  author       = {Gary A. Kochenberger and
                  Fred W. Glover and
                  Bahram Alidaee and
                  C{\'{e}}sar Rego},
  title        = {An Unconstrained Quadratic Binary Programming Approach to the Vertex
                  Coloring Problem},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {229--241},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3449-7},
  doi          = {10.1007/S10479-005-3449-7},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/anor/KochenbergerGAR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/LadanyiLL05,
  author       = {Laszlo Lad{\'{a}}nyi and
                  Jon Lee and
                  Robin Lougee{-}Heimer},
  title        = {Rapid Prototyping of Optimization Algorithms Using {COIN-OR:} {A}
                  Case Study Involving the Cutting-Stock Problem},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {243--265},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3450-1},
  doi          = {10.1007/S10479-005-3450-1},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/LadanyiLL05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/LeeG05,
  author       = {Sangbum Lee and
                  Ignacio E. Grossmann},
  title        = {Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous
                  Optimization Problems},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {267--288},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3451-0},
  doi          = {10.1007/S10479-005-3451-0},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/LeeG05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Lougee-HeimerA05,
  author       = {R. Lougee{-}Heimer and
                  W. Adams},
  title        = {A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {289--320},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3452-z},
  doi          = {10.1007/S10479-005-3452-Z},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Lougee-HeimerA05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Padberg05,
  author       = {Manfred Padberg},
  title        = {Classical Cuts for Mixed-Integer Programming and Branch-and-Cut},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {321--352},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3453-y},
  doi          = {10.1007/S10479-005-3453-Y},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/Padberg05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/ThionganeNP05,
  author       = {Babacar Thiongane and
                  Anass Nagih and
                  G{\'{e}}rard Plateau},
  title        = {An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {353--373},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3454-x},
  doi          = {10.1007/S10479-005-3454-X},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/ThionganeNP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/VilleneuveDLS05,
  author       = {Daniel Villeneuve and
                  Jacques Desrosiers and
                  Marco E. L{\"{u}}bbecke and
                  Fran{\c{c}}ois Soumis},
  title        = {On Compact Formulations for Integer Programs Solved by Column Generation},
  journal      = {Ann. Oper. Res.},
  volume       = {139},
  number       = {1},
  pages        = {375--388},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-005-3455-9},
  doi          = {10.1007/S10479-005-3455-9},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/VilleneuveDLS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics