Pages that link to "Item:Q285917"
From MaRDI portal
The following pages link to EURO Journal on Computational Optimization (Q285917):
Displayed 50 items.
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints (Q2397763) (← links)
- The summed start-up costs in a unit commitment problem (Q2397765) (← links)
- Sufficient pruning conditions for MINLP in gas network design (Q2397766) (← links)
- A MIP framework for non-convex uniform price day-ahead electricity auctions (Q2397767) (← links)
- Multi-machine energy-aware scheduling (Q2397770) (← links)
- Optimizing compatible sets in wireless networks through integer programming (Q2513731) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
- A complete search method for the relaxed traveling tournament problem (Q2513735) (← links)
- Special issue on: Constraint programming approaches to combinatorial optimization (Q2513742) (← links)
- A constraint programming primer (Q2513743) (← links)
- Improving strong branching by domain propagation (Q2513744) (← links)
- Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments (Q2513745) (← links)
- CP methods for scheduling and routing with~time-dependent task costs (Q2513747) (← links)
- Solving wind farm layout optimization with mixed integer programs and constraint programs (Q2513750) (← links)
- Special issue on: `matheuristics` (Q2513751) (← links)
- A survey on matheuristics for routing problems (Q2513752) (← links)
- Optimal selection of contracts and work shifts in multi-skill call centers (Q2513755) (← links)
- A Lagrangian-ACO matheuristic for car sequencing (Q2513756) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- Evaluating the quality of image matrices in blockmodeling (Q2516355) (← links)
- A nonlinear preconditioner for optimum experimental design problems (Q2516356) (← links)
- Optimal online \(k\)-min search (Q2516358) (← links)
- Editorial (Q5965491) (← links)
- A merit function approach for evolution strategies (Q6114898) (← links)
- Robust flows with adaptive mitigation (Q6114899) (← links)
- A branch-and-bound approach for a vehicle routing problem with customer costs (Q6114901) (← links)
- The Steiner bi-objective shortest path problem (Q6114902) (← links)
- Sample average approximation for risk-averse problems: a virtual power plant scheduling application (Q6114903) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- Pareto front approximation through a multi-objective augmented Lagrangian method (Q6114906) (← links)
- Multi-sourcing under supply uncertainty and buyer's risk aversion (Q6114907) (← links)
- Mobility offer allocations in corporate settings (Q6114908) (← links)
- Two decades of blackbox optimization applications (Q6114909) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem (Q6114925) (← links)
- Robot Dance: a mathematical optimization platform for intervention against COVID-19 in a complex network (Q6114926) (← links)
- The Marguerite Frank award for the best EJCO paper 2021 (Q6114927) (← links)
- A reinforcement learning approach to the stochastic cutting stock problem (Q6114929) (← links)
- Exponential extrapolation memory for tabu search (Q6114931) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
- Progress in mathematical programming solvers from 2001 to 2020 (Q6114935) (← links)
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem (Q6114936) (← links)
- EUR\(O\)pt, the continuous optimization working group of EURO: from idea to maturity (Q6114937) (← links)
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
- Newton-MR: inexact Newton method with minimum residual sub-problem solver (Q6114941) (← links)