The following pages link to Annals of Operations Research (Q59875):
Displaying 50 items.
- A destination optimality in asymmetric distance Fermat-Weber problems (Q689258) (← links)
- Light traffic heuristic for an \(M/G/1\) queue with limited inventory (Q689259) (← links)
- Demand sensitivity to space-price competition with Manhattan and Euclidean representations of distance (Q689262) (← links)
- Density based problem space search for the capacitated clustering \(p\)-median problem (Q702709) (← links)
- On a local-search heuristic for a class of tracking error minimization problems in portfolio management (Q702711) (← links)
- Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection (Q702713) (← links)
- A short note on a simple search heuristic for the diskspacking problem (Q702715) (← links)
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design (Q702717) (← links)
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm (Q702718) (← links)
- Competitive memetic algorithms for arc routing problems (Q702720) (← links)
- GENI ants for the traveling salesman problem (Q702722) (← links)
- TSpack: A unified tabu search code for multi-dimensional bin packing problems (Q702723) (← links)
- A rollout metaheuristic for job shop scheduling problems (Q702727) (← links)
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search (Q702729) (← links)
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem (Q702730) (← links)
- An ant colony optimization algorithm for the minimum weight vertex cover problem (Q702732) (← links)
- A population-based approach to the resource-constrained project scheduling problem (Q702733) (← links)
- Multilevel refinement for combinatorial optimisation problems (Q702735) (← links)
- Model-based search for combinatorial optimization: A critical survey (Q702737) (← links)
- Preface to the 12th international conference on project management and scheduling (Q744628) (← links)
- Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
- A new approach for quantitative risk analysis (Q744631) (← links)
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634) (← links)
- Stable multi-skill workforce assignments (Q744637) (← links)
- Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
- Isomorphic scheduling problems (Q744639) (← links)
- Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
- Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
- Batch sizing and just-in-time scheduling with common due date (Q744646) (← links)
- Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective (Q744648) (← links)
- Scheduling job families on non-identical parallel machines with time constraints (Q744650) (← links)
- Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan (Q744652) (← links)
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
- Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment (Q744657) (← links)
- Integrated production and distribution scheduling with lifespan constraints (Q744659) (← links)
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results (Q744660) (← links)
- Preface: Mathematical modeling of electoral systems: analysis, evaluation, optimization. In memory of Bruno Simeone (1945--2010) (Q744661) (← links)
- Limit points of the iterative scaling procedure (Q744663) (← links)
- Power distribution in the Weimar Reichstag in 1919--1933 (Q744665) (← links)
- Parametric vs. divisor methods of apportionment (Q744667) (← links)
- The bargaining set for sharing the power (Q744668) (← links)
- Political engineering: optimizing a U.S. Presidential candidate's platform (Q744671) (← links)
- Asymptotic bias of some election methods (Q744672) (← links)
- Heuristic and exact solutions to the inverse power index problem for small voting bodies (Q744673) (← links)
- Bidimensional allocation of seats via zero-one matrices with given line sums (Q744674) (← links)
- Dynamic adjustment: an electoral method for relaxed double proportionality (Q744676) (← links)
- Competition among parties and power: an empirical analysis (Q744680) (← links)
- Banzhaf index for multiple voting systems. An application to the European Union (Q744681) (← links)
- Some remarks on the concept of proportionality (Q744682) (← links)
