ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • quadratic programming  (2)
  • Electrokinetic capillary chromatography  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 63 (1994), S. 1-22 
    ISSN: 1436-4646
    Keywords: Graph theory ; shortest paths ; inverse problems ; quadratic programming ; traffic modelling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper considers the inverse shortest paths problem where arc costs are subject to correlation constraints. The motivation for this research arises from applications in traffic modelling and seismic tomography. A new method is proposed for solving this class of problems. It is constructed as a generalization of the algorithm presented in Burton and Toint (Mathematical Programming 53, 1992) for uncorrelated inverse shortest paths. Preliminary numerical experience with the new method is presented and discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 1612-1112
    Keywords: Electrokinetic capillary chromatography ; Injection parameters ; Efficiency
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Summary Micellar electrokinetic capillary chromatography (MECC) involves the application of a high voltage (10–30 KV) across a capillary column (75μm i.d.) which is filled with a solution containing micelles. The mobile phase in this work consisted of sodium dodecyl sulfate in an aqueous borate/phosphate buffer system. Injection parameters in MECC were investigated to minimize the contribution to band-broadening resulting from the injection process. Efficiencies as high as 240,000 theoretical plates/meter are reported.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 53 (1992), S. 45-61 
    ISSN: 1436-4646
    Keywords: Graph theory ; shortest paths ; inverse problems ; quadratic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The inverse shortest paths problem in a graph is considered, that is, the problem of recovering the arc costs given some information about the shortest paths in the graph. The problem is first motivated by some practical examples arising from applications. An algorithm based on the Goldfarb-Idnani method for convex quadratic programming is then proposed and analyzed for one of the instances of the problem. Preliminary numerical results are reported.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...