Larry J. LeBlanc

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with David E. Boyce

> Home > Persons > Larry J. LeBlanc

Publications

1995
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/transci/BoyceRL95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/transci/BoyceRL95
David E. Boyce, Bin Ran, Larry J. LeBlanc:
Solving an Instantaneous Dynamic User-Optimal Route Choice Model. Transp. Sci. 29(2): 128-142 (1995)
1993
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/ior/RanBL93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ior/RanBL93
Bin Ran, David E. Boyce, Larry J. LeBlanc:
A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models. Oper. Res. 41(1): 192-202 (1993)
1992
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/anor/Ben-AyedBBL92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/Ben-AyedBBL92
Omar Ben-Ayed, Charles E. Blair, David E. Boyce, Larry J. LeBlanc:
Construction of a real-world bilevel linear programming model of the highway network design problem. Ann. Oper. Res. 34: 219-254 (1992)
1985
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/transci/LeBlancHB85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/transci/LeBlancHB85
Larry J. LeBlanc, Richard V. Helgason, David E. Boyce:
Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs. Transp. Sci. 19(4): 445-462 (1985)

a service of

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.