BibTeX records: Bruce Faaland

• > Home > Persons > Bruce Faaland

@article{DBLP:journals/ior/FaalandS93,
  author       = {Bruce Faaland and
                  Tom Schmitt},
  title        = {Cost-Based Scheduling of Workers and Equipment in a Fabrication and
                  Assembly Shop},
  journal      = {Oper. Res.},
  volume       = {41},
  number       = {2},
  pages        = {253--268},
  year         = {1993},
  url          = {https://doi.org/10.1287/opre.41.2.253},
  doi          = {10.1287/OPRE.41.2.253},
  timestamp    = {Tue, 31 Mar 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ior/FaalandS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ior/FaalandS87,
  author       = {Bruce Faaland and
                  Tom Schmitt},
  title        = {Scheduling Tasks with Due Dates in a Fabrication/Assembly Process},
  journal      = {Oper. Res.},
  volume       = {35},
  number       = {3},
  pages        = {378--388},
  year         = {1987},
  url          = {https://doi.org/10.1287/opre.35.3.378},
  doi          = {10.1287/OPRE.35.3.378},
  timestamp    = {Tue, 31 Mar 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ior/FaalandS87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cacm/DiehrF84,
  author       = {George Diehr and
                  Bruce Faaland},
  title        = {Optimal Pagination of B-Trees with Variable-Length Items},
  journal      = {Commun. {ACM}},
  volume       = {27},
  number       = {3},
  pages        = {241--247},
  year         = {1984},
  url          = {https://doi.org/10.1145/357994.358025},
  doi          = {10.1145/357994.358025},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cacm/DiehrF84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ior/Faaland84,
  author       = {Bruce Faaland},
  title        = {A Weighted Selection Algorithm for Certain Tree-Structured Linear
                  Programs},
  journal      = {Oper. Res.},
  volume       = {32},
  number       = {2},
  pages        = {405--422},
  year         = {1984},
  url          = {https://doi.org/10.1287/opre.32.2.405},
  doi          = {10.1287/OPRE.32.2.405},
  timestamp    = {Tue, 31 Mar 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ior/Faaland84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ior/Faaland81,
  author       = {Bruce H. Faaland},
  title        = {Technical Note - The Multiperiod Knapsack Problem},
  journal      = {Oper. Res.},
  volume       = {29},
  number       = {3},
  pages        = {612--616},
  year         = {1981},
  url          = {https://doi.org/10.1287/opre.29.3.612},
  doi          = {10.1287/OPRE.29.3.612},
  timestamp    = {Tue, 31 Mar 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ior/Faaland81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ior/FaalandH79,
  author       = {Bruce H. Faaland and
                  Frederick S. Hillier},
  title        = {Interior Path Methods for Heuristic Integer Programming Procedures},
  journal      = {Oper. Res.},
  volume       = {27},
  number       = {6},
  pages        = {1069--1087},
  year         = {1979},
  url          = {https://doi.org/10.1287/opre.27.6.1069},
  doi          = {10.1287/OPRE.27.6.1069},
  timestamp    = {Tue, 31 Mar 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ior/FaalandH79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ior/FaalandH75,
  author       = {Bruce H. Faaland and
                  Frederick S. Hillier},
  title        = {The Accelerated Bound-and-Scan Algorithm for Integer Programming},
  journal      = {Oper. Res.},
  volume       = {23},
  number       = {3},
  pages        = {406--433},
  year         = {1975},
  url          = {https://doi.org/10.1287/opre.23.3.406},
  doi          = {10.1287/OPRE.23.3.406},
  timestamp    = {Tue, 31 Mar 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ior/FaalandH75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ior/Faaland73,
  author       = {Bruce Faaland},
  title        = {Technical Note - Solution of the Value-Independent Knapsack Problem
                  by Partitioning},
  journal      = {Oper. Res.},
  volume       = {21},
  number       = {1},
  pages        = {332--337},
  year         = {1973},
  url          = {https://doi.org/10.1287/opre.21.1.332},
  doi          = {10.1287/OPRE.21.1.332},
  timestamp    = {Tue, 31 Mar 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ior/Faaland73.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Faaland72,
  author       = {Bruce Faaland},
  title        = {On the Number of Solutions to a Diophantine Equation},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {13},
  number       = {2},
  pages        = {170--175},
  year         = {1972},
  url          = {https://doi.org/10.1016/0097-3165(72)90023-4},
  doi          = {10.1016/0097-3165(72)90023-4},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Faaland72.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}