The Algebraic Degree of Geometric Optimization Problems.

C. Bajaj

Discrete & computational geometry (1988)

  • Volume: 3, Issue: 1-2, page 177-192
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Bajaj, C.. "The Algebraic Degree of Geometric Optimization Problems.." Discrete & computational geometry 3.1-2 (1988): 177-192. <http://eudml.org/doc/186386>.

@article{Bajaj1988,
author = {Bajaj, C.},
journal = {Discrete & computational geometry},
keywords = {algebraic degree; facility location; Galois methods; classic Weber problem; line-restricted Weber problem},
number = {1-2},
pages = {177-192},
title = {The Algebraic Degree of Geometric Optimization Problems.},
url = {http://eudml.org/doc/186386},
volume = {3},
year = {1988},
}

TY - JOUR
AU - Bajaj, C.
TI - The Algebraic Degree of Geometric Optimization Problems.
JO - Discrete & computational geometry
PY - 1988
VL - 3
IS - 1-2
SP - 177
EP - 192
KW - algebraic degree; facility location; Galois methods; classic Weber problem; line-restricted Weber problem
UR - http://eudml.org/doc/186386
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.