BibTeX records: Leslie A. Hall

download as .bib file

@article{DBLP:journals/networks/GouveiaH02,
  author       = {Luis Eduardo Neves Gouveia and
                  Leslie A. Hall},
  title        = {Multistars and directed flow formulations},
  journal      = {Networks},
  volume       = {40},
  number       = {4},
  pages        = {188--201},
  year         = {2002},
  url          = {https://doi.org/10.1002/net.10050},
  doi          = {10.1002/NET.10050},
  timestamp    = {Mon, 21 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/GouveiaH02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Hall98,
  author       = {Leslie A. Hall},
  title        = {Approximability of flow shop scheduling},
  journal      = {Math. Program.},
  volume       = {82},
  pages        = {175--190},
  year         = {1998},
  url          = {https://doi.org/10.1007/BF01585870},
  doi          = {10.1007/BF01585870},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Hall98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ior/WilliamsonHHHLS97,
  author       = {David P. Williamson and
                  Leslie A. Hall and
                  J. A. Hoogeveen and
                  Cor A. J. Hurkens and
                  Jan Karel Lenstra and
                  Sergey Vasil'evich Sevast'janov and
                  David B. Shmoys},
  title        = {Short Shop Schedules},
  journal      = {Oper. Res.},
  volume       = {45},
  number       = {2},
  pages        = {288--294},
  year         = {1997},
  url          = {https://doi.org/10.1287/opre.45.2.288},
  doi          = {10.1287/OPRE.45.2.288},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ior/WilliamsonHHHLS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mor/HallSSW97,
  author       = {Leslie A. Hall and
                  Andreas S. Schulz and
                  David B. Shmoys and
                  Joel Wein},
  title        = {Scheduling to Minimize Average Completion Time: Off-Line and On-Line
                  Approximation Algorithms},
  journal      = {Math. Oper. Res.},
  volume       = {22},
  number       = {3},
  pages        = {513--544},
  year         = {1997},
  url          = {https://doi.org/10.1287/moor.22.3.513},
  doi          = {10.1287/MOOR.22.3.513},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/HallSSW97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ipco/GoemansH96,
  author       = {Michel X. Goemans and
                  Leslie A. Hall},
  editor       = {William H. Cunningham and
                  S. Thomas McCormick and
                  Maurice Queyranne},
  title        = {The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown},
  booktitle    = {Integer Programming and Combinatorial Optimization, 5th International
                  {IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5,
                  1996, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1084},
  pages        = {415--429},
  publisher    = {Springer},
  year         = {1996},
  url          = {https://doi.org/10.1007/3-540-61310-2\_31},
  doi          = {10.1007/3-540-61310-2\_31},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/GoemansH96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/HallSW96,
  author       = {Leslie A. Hall and
                  David B. Shmoys and
                  Joel Wein},
  editor       = {{\'{E}}va Tardos},
  title        = {Scheduling to Minimize Average Completion Time: Off-line and On-line
                  Algorithms},
  booktitle    = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
  pages        = {142--151},
  publisher    = {{ACM/SIAM}},
  year         = {1996},
  url          = {http://dl.acm.org/citation.cfm?id=313852.313907},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/HallSW96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/Hall95,
  author       = {Leslie A. Hall},
  title        = {Approximability of Flow Shop Scheduling},
  booktitle    = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
                  Wisconsin, USA, 23-25 October 1995},
  pages        = {82--91},
  publisher    = {{IEEE} Computer Society},
  year         = {1995},
  url          = {https://doi.org/10.1109/SFCS.1995.492465},
  doi          = {10.1109/SFCS.1995.492465},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Hall95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mor/Hall94,
  author       = {Leslie A. Hall},
  title        = {A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling
                  Problem},
  journal      = {Math. Oper. Res.},
  volume       = {19},
  number       = {1},
  pages        = {68--85},
  year         = {1994},
  url          = {https://doi.org/10.1287/moor.19.1.68},
  doi          = {10.1287/MOOR.19.1.68},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/Hall94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Hall93,
  author       = {Leslie A. Hall},
  title        = {A Note on Generalizing the Maximum Lateness Criterion for Scheduling},
  journal      = {Discret. Appl. Math.},
  volume       = {47},
  number       = {2},
  pages        = {129--137},
  year         = {1993},
  url          = {https://doi.org/10.1016/0166-218X(93)90087-5},
  doi          = {10.1016/0166-218X(93)90087-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Hall93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/orl/HallV93,
  author       = {Leslie A. Hall and
                  Robert J. Vanderbei},
  title        = {Two-thirds is sharp for affine scaling},
  journal      = {Oper. Res. Lett.},
  volume       = {13},
  number       = {4},
  pages        = {197--201},
  year         = {1993},
  url          = {https://doi.org/10.1016/0167-6377(93)90040-N},
  doi          = {10.1016/0167-6377(93)90040-N},
  timestamp    = {Tue, 21 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/orl/HallV93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mor/HallS92,
  author       = {Leslie A. Hall and
                  David B. Shmoys},
  title        = {Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic
                  Better},
  journal      = {Math. Oper. Res.},
  volume       = {17},
  number       = {1},
  pages        = {22--35},
  year         = {1992},
  url          = {https://doi.org/10.1287/moor.17.1.22},
  doi          = {10.1287/MOOR.17.1.22},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/HallS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mor/HallM92,
  author       = {Leslie A. Hall and
                  Thomas L. Magnanti},
  title        = {A Polyhedral Intersection Theorem for Capacitated Spanning Trees},
  journal      = {Math. Oper. Res.},
  volume       = {17},
  number       = {2},
  pages        = {398--410},
  year         = {1992},
  url          = {https://doi.org/10.1287/moor.17.2.398},
  doi          = {10.1287/MOOR.17.2.398},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/HallM92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ipco/HallS90,
  author       = {Leslie A. Hall and
                  David B. Shmoys},
  editor       = {Ravi Kannan and
                  William R. Pulleyblank},
  title        = {Near-Optimal Sequencing with Precedence Constraints},
  booktitle    = {Proceedings of the 1st Integer Programming and Combinatorial Optimization
                  Conference, Waterloo, Ontorio, Canada, May 28-30 1990},
  pages        = {249--260},
  publisher    = {University of Waterloo Press},
  year         = {1990},
  timestamp    = {Wed, 09 Oct 2002 12:35:47 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/HallS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/HallS89,
  author       = {Leslie A. Hall and
                  David B. Shmoys},
  title        = {Approximation Schemes for Constrained Scheduling Problems},
  booktitle    = {30th Annual Symposium on Foundations of Computer Science, Research
                  Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
  pages        = {134--139},
  publisher    = {{IEEE} Computer Society},
  year         = {1989},
  url          = {https://doi.org/10.1109/SFCS.1989.63468},
  doi          = {10.1109/SFCS.1989.63468},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/HallS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.