Search dblp for Publications

export results for "toc:db/journals/4or/4or2.bht:"

 download as .bib file

@article{DBLP:journals/4or/AbracheCG04,
  author       = {Jawad Abrache and
                  Teodor Gabriel Crainic and
                  Michel Gendreau},
  title        = {Design issues for combinatorial auctions},
  journal      = {4OR},
  volume       = {2},
  number       = {1},
  pages        = {1--33},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0033-y},
  doi          = {10.1007/S10288-004-0033-Y},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/AbracheCG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/BacheletM04,
  author       = {Bruno Bachelet and
                  Philippe Mahey},
  title        = {Minimum convex piecewise linear cost tension problem on quasi-\emph{k}
                  series-parallel graphs},
  journal      = {4OR},
  volume       = {2},
  number       = {4},
  pages        = {275--291},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0049-3},
  doi          = {10.1007/S10288-004-0049-3},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/BacheletM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/BaptisteBKT04,
  author       = {Philippe Baptiste and
                  Peter Brucker and
                  Sigrid Knust and
                  Vadim G. Timkovsky},
  title        = {Ten notes on equal-processing-time scheduling},
  journal      = {4OR},
  volume       = {2},
  number       = {2},
  pages        = {111--127},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-003-0024-4},
  doi          = {10.1007/S10288-003-0024-4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/BaptisteBKT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/BarthelemyBO04,
  author       = {Jean{-}Pierre Barth{\'{e}}lemy and
                  Fran{\c{c}}ois Brucker and
                  Christophe Osswald},
  title        = {Combinatorial optimization and hierarchical classifications},
  journal      = {4OR},
  volume       = {2},
  number       = {3},
  pages        = {179--219},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0051-9},
  doi          = {10.1007/S10288-004-0051-9},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/BarthelemyBO04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/BenoistR04,
  author       = {Thierry Benoist and
                  Beno{\^{\i}}t Rottembourg},
  title        = {Upper bounds for revenue maximization in a satellite scheduling problem},
  journal      = {4OR},
  volume       = {2},
  number       = {3},
  pages        = {235--249},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0044-8},
  doi          = {10.1007/S10288-004-0044-8},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/BenoistR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/BeraldiCTV04,
  author       = {Patrizia Beraldi and
                  Domenico Conforti and
                  Chefi Triki and
                  Antonio Violi},
  title        = {Constrained auction clearing in the Italian electricity market},
  journal      = {4OR},
  volume       = {2},
  number       = {1},
  pages        = {35--51},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0034-x},
  doi          = {10.1007/S10288-004-0034-X},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/BeraldiCTV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Bisdorff04,
  author       = {Raymond Bisdorff},
  title        = {Concordant outranking with multiple criteria of ordinal significance},
  journal      = {4OR},
  volume       = {2},
  number       = {4},
  pages        = {293--308},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0053-7},
  doi          = {10.1007/S10288-004-0053-7},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Bisdorff04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/BransG04,
  author       = {Jean{-}Pierre Brans and
                  Giorgio Gallo},
  title        = {Ethics in {OR/MS:} Past, present and future},
  journal      = {4OR},
  volume       = {2},
  number       = {2},
  pages        = {95--110},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0039-5},
  doi          = {10.1007/S10288-004-0039-5},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/BransG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Caprara04,
  author       = {Alberto Caprara},
  title        = {Knapsack problems: {A} book review},
  journal      = {4OR},
  volume       = {2},
  number       = {4},
  pages        = {317--320},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0054-6},
  doi          = {10.1007/S10288-004-0054-6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Caprara04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/CarrL04,
  author       = {Robert D. Carr and
                  Giuseppe Lancia},
  title        = {Compact optimization can outperform separation: {A} case study in
                  structural proteomics},
  journal      = {4OR},
  volume       = {2},
  number       = {3},
  pages        = {221--233},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0036-8},
  doi          = {10.1007/S10288-004-0036-8},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/4or/CarrL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Colson04,
  author       = {Beno{\^{\i}}t Colson},
  title        = {Trust-region algorithms for derivative-free optimization and nonlinear
                  bilevel programming},
  journal      = {4OR},
  volume       = {2},
  number       = {1},
  pages        = {85--88},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-003-0020-8},
  doi          = {10.1007/S10288-003-0020-8},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Colson04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/ConfortiR04,
  author       = {Michelangelo Conforti and
                  Romeo Rizzi},
  title        = {Combinatorial optimization - Polyhedra and efficiency: {A} book review},
  journal      = {4OR},
  volume       = {2},
  number       = {2},
  pages        = {153--159},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0035-9},
  doi          = {10.1007/S10288-004-0035-9},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/ConfortiR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Danna04,
  author       = {Emilie Danna},
  title        = {Integrating local search techniques into mixed integer programming},
  journal      = {4OR},
  volume       = {2},
  number       = {4},
  pages        = {321--324},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0042-x},
  doi          = {10.1007/S10288-004-0042-X},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Danna04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Fasano04,
  author       = {Giorgio Fasano},
  title        = {A {MIP} approach for some practical packing problems: Balancing constraints
                  and tetris-like items},
  journal      = {4OR},
  volume       = {2},
  number       = {2},
  pages        = {161--174},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0037-7},
  doi          = {10.1007/S10288-004-0037-7},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Fasano04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/KrarupR04,
  author       = {Jakob Krarup and
                  Malene Nordlund R{\o}rbech},
  title        = {{LP} formulations of the shortest path tree problem},
  journal      = {4OR},
  volume       = {2},
  number       = {4},
  pages        = {259--274},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0048-4},
  doi          = {10.1007/S10288-004-0048-4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/KrarupR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Leus04,
  author       = {Roel Leus},
  title        = {The generation of stable project plans},
  journal      = {4OR},
  volume       = {2},
  number       = {3},
  pages        = {251--254},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-003-0031-5},
  doi          = {10.1007/S10288-003-0031-5},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Leus04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Liberti04,
  author       = {Leo Liberti},
  title        = {Reformulation and convex relaxation techniques for global optimization},
  journal      = {4OR},
  volume       = {2},
  number       = {3},
  pages        = {255--258},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0038-6},
  doi          = {10.1007/S10288-004-0038-6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Liberti04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Martello04,
  author       = {Silvano Martello},
  title        = {Stefano Pallottino {(1945-2004)}},
  journal      = {4OR},
  volume       = {2},
  number       = {2},
  pages        = {93--93},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0040-z},
  doi          = {10.1007/S10288-004-0040-Z},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Martello04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/MaurrasV04,
  author       = {Jean Fran{\c{c}}ois Maurras and
                  Sonia Vanier},
  title        = {Network synthesis under survivability constraints},
  journal      = {4OR},
  volume       = {2},
  number       = {1},
  pages        = {53--67},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-003-0025-3},
  doi          = {10.1007/S10288-003-0025-3},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/MaurrasV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Pinar04,
  author       = {Mustafa {\c{C}}. Pinar},
  title        = {A note on robust 0-1 optimization with uncertain cost coefficients},
  journal      = {4OR},
  volume       = {2},
  number       = {4},
  pages        = {309--316},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0041-y},
  doi          = {10.1007/S10288-004-0041-Y},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Pinar04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/SevauxS04,
  author       = {Marc Sevaux and
                  Kenneth S{\"{o}}rensen},
  title        = {A genetic algorithm for robust schedules in a one-machine environment
                  with ready times and due dates},
  journal      = {4OR},
  volume       = {2},
  number       = {2},
  pages        = {129--147},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-003-0028-0},
  doi          = {10.1007/S10288-003-0028-0},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/SevauxS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Spanjaard04,
  author       = {Olivier Spanjaard},
  title        = {Non-classical preference models in combinatorial problems: Models
                  and algorithms for graphs},
  journal      = {4OR},
  volume       = {2},
  number       = {4},
  pages        = {325--328},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-004-0045-7},
  doi          = {10.1007/S10288-004-0045-7},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Spanjaard04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/StoyanSGR04,
  author       = {Yurij Stoyan and
                  Guntram Scheithauer and
                  Nikolay Gil and
                  Tatiana E. Romanova},
  title        = {Phi-functions for complex 2D-objects},
  journal      = {4OR},
  volume       = {2},
  number       = {1},
  pages        = {69--84},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-003-0027-1},
  doi          = {10.1007/S10288-003-0027-1},
  timestamp    = {Mon, 23 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/4or/StoyanSGR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Vyve04,
  author       = {Mathieu Van Vyve},
  title        = {A solution approach of production planning problems based on compact
                  formulations for single-item lot-sizing models},
  journal      = {4OR},
  volume       = {2},
  number       = {1},
  pages        = {89--91},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-003-0026-2},
  doi          = {10.1007/S10288-003-0026-2},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Vyve04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Wagler04,
  author       = {Annegret Wagler},
  title        = {Antiwebs are rank-perfect},
  journal      = {4OR},
  volume       = {2},
  number       = {2},
  pages        = {149--152},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-003-0032-4},
  doi          = {10.1007/S10288-003-0032-4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Wagler04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/4or/Yaman04,
  author       = {Hande Yaman},
  title        = {Concentrator location in telecommunications},
  journal      = {4OR},
  volume       = {2},
  number       = {2},
  pages        = {175--177},
  year         = {2004},
  url          = {https://doi.org/10.1007/s10288-003-0030-6},
  doi          = {10.1007/S10288-003-0030-6},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/4or/Yaman04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.