The following article by Katta Murty, "A Problem in Enumerating Extreme
Points, and an efficient Algorithm.", sheds some light on the issue; see
http://www-personal.umich.edu/~murty/segments.pdf
My first thought on such a task is to fix all variablee,
structural and otherwise, with nonzero reduced costs.
Unless using exact arithmetic,
that is an interesting task in itself.
Even so, I'd expect it to be better than using
a single linear constraint to implicitly fix them.
A better tactic
Hi,
El vie, 07-10-2022 a las 11:04 +1030, Prabhu Manyem escribió:
> To Andrew, Peter and Manuel,
>
> Thank you for your help on this topic.
>
> To Manuel, Why only vertices next to the starting vertex? If the
> links are A-->B-->C and B-->D, so first you go from A to B, then B to
> C, then
To Andrew, Peter and Manuel,
Thank you for your help on this topic.
To Manuel, Why only vertices next to the starting vertex? If the
links are A-->B-->C and B-->D, so first you go from A to B, then B to
C, then backtrack to B (from C), and then you can go from B to D...
This is what I had in
jue, 06-10-2022 a las 13:49 +0300, Andrew Makhorin escribió:
Forwarded Message
From: Prabhu Manyem
To: fuk...@math.ethz.ch, Andrew Makhorin ,
avis@cs.mcgill.c
a
Subject: Linear Program Optimal Extreme Points
Date: Thu, 6 Oct 2022 10:04:22 +1030
Dear Andrew, Komei, David,
I am
; From: Prabhu Manyem
> To: fuk...@math.ethz.ch, Andrew Makhorin , avis@cs.mcgill.c
> a
> Subject: Linear Program Optimal Extreme Points
> Date: Thu, 6 Oct 2022 10:04:22 +1030
>
> Dear Andrew, Komei, David,
>
> I am a retired Maths professor in Adelaide, Australia.
>
>
Forwarded Message
From: Prabhu Manyem
To: fuk...@math.ethz.ch, Andrew Makhorin , avis@cs.mcgill.c
a
Subject: Linear Program Optimal Extreme Points
Date: Thu, 6 Oct 2022 10:04:22 +1030
Dear Andrew, Komei, David,
I am a retired Maths professor in Adelaide, Australia.
About
