The following pages link to Kim Allan Andersen (Q732916):
Displayed 25 items.
- Erratum to ``An algorithm for ranking assignments using reoptimization'' [Computers \& Operations Research 35 (2008) 3714-3726] (Q732917) (← links)
- Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks (Q833580) (← links)
- Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search (Q868140) (← links)
- On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees (Q1296806) (← links)
- Characterizing consistency in probabilistic logic for a class of Horn clauses (Q1340063) (← links)
- On bicriterion minimal spanning trees: An approximation (Q1360130) (← links)
- Finding the \(K\) shortest hyperpaths (Q1764762) (← links)
- Applying the minimax criterion in stochastic recourse programs (Q1771344) (← links)
- (Q1815823) (redirect page) (← links)
- Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs (Q1815824) (← links)
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (Q1869670) (← links)
- Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives (Q1877893) (← links)
- Multiperiod capacity expansion of a telecommunications connection with uncertain demand (Q1883893) (← links)
- Computing the NTU-Shapley value of NTU-games defined by multiple objective linear programs (Q1961976) (← links)
- A label correcting approach for solving bicriterion shortest-path problems (Q1977617) (← links)
- Easy cases of probabilistic satisfiability (Q2349813) (← links)
- An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
- Ranking paths in stochastic time-dependent networks (Q2514742) (← links)
- Capacitated Network Design with Uncertain Demand (Q2884535) (← links)
- The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results (Q2901023) (← links)
- Bicriterion Shortest Paths in Stochastic Time-Dependent Networks (Q3649590) (← links)
- (Q3840282) (← links)
- (Q3840285) (← links)
- Bicriterion shortest hyperpaths in random time-dependent networks (Q4464024) (← links)
- A Tabu Search Approach to Clustering (Q5392097) (← links)