Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bohdan Kaluzny

dblp:78/3118 · also Bohdan L. Kaluzny · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorTheory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 67% Computational geometry · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry › arrangement
hyperplane arrangement
0.012004
The criss-cross method can take Omega(nd) pivots · SCG 2004
Mathematical optimization
linear programming
0.012004
The criss-cross method can take Omega(nd) pivots · SCG 2004
Mathematical optimization › linear programming
simplex method
0.012004
The criss-cross method can take Omega(nd) pivots · SCG 2004

Methods — techniques the papers use, named apart from their topics

worst-case pivot analysis · 0.0
YearPublicationVenuePosition
2013 Simulating the Repatriation of Canadian Forces Materiel from Afghanistan
Bohdan Kaluzny, Raman Pall
ICORES1
2009 An optimisation model for airlift load planning: Galahad and the quest for the 'holy grail'
abstract
This paper presents an aircraft load allocation optimisation model, which uses a hybrid of simulated annealing and genetic algorithm methods to solve a multi-objective optimisation problem associated with allocating a set of cargo items across a heterogeneous fleet of available airlift assets. It represents candidate solutions using macrochromosomes comprised of an ordered list of available transport assets followed by an ordered list of cargo items. A bin packing heuristic is used to map each individual to a point in asset-utilization space where a novel convex hull based fitness function is used to evaluate the relative quality of each individual and drive an elitist application of genetic operators on the population - including a novel extinction operation that infrequently culls solutions comprising of aircraft chalks that cannot be load balanced. Proof of concept computational results are presented.
Bohdan Kaluzny, R. H. A. David Shaw, Ahmed Ghanmi
CISDA1
2004 The criss-cross method can take Omega(nd) pivots
abstract
Using deformed products of arrangements, we construct a family of linearprograms with n inequalities in Rd on which, in the worst-case, the least-index criss-cross methodrequires Ω(nd) (for fixed d) pivots to reach optimality.
Bohdan Kaluzny, Komei Fukuda
SCG1