Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Optimal online \(k\)-min search: Label: en
A nonlinear preconditioner for optimum experimental design problems: Label: en
Evaluating the quality of image matrices in blockmodeling: Label: en
A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices: Label: en
A Lagrangian-ACO matheuristic for car sequencing: Label: en
Optimal selection of contracts and work shifts in multi-skill call centers: Label: en
A survey on matheuristics for routing problems: Label: en
Special issue on: `matheuristics`: Label: en
Solving wind farm layout optimization with mixed integer programs and constraint programs: Label: en
CP methods for scheduling and routing with~time-dependent task costs: Label: en
Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments: Label: en
Improving strong branching by domain propagation: Label: en
A constraint programming primer: Label: en
Special issue on: Constraint programming approaches to combinatorial optimization: Label: en
A complete search method for the relaxed traveling tournament problem: Label: en
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design: Label: en
Towards optimizing the deployment of optical access networks: Label: en
Optimizing compatible sets in wireless networks through integer programming: Label: en
Multi-machine energy-aware scheduling: Label: en
A MIP framework for non-convex uniform price day-ahead electricity auctions: Label: en
Sufficient pruning conditions for MINLP in gas network design: Label: en
The summed start-up costs in a unit commitment problem: Label: en
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints: Label: en
Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints: Label: en
A comparison of four approaches from stochastic programming for large-scale unit-commitment: Label: en
A bounded degree SOS hierarchy for polynomial optimization: Label: en
A multiplicative weights update algorithm for MINLP: Label: en
Uncontrolled inexact information within bundle methods: Label: en
Special issue on: Nonlinear and combinatorial methods for energy optimization: Label: en
Real-time algorithms for the bilevel double-deck elevator dispatching problem: Label: en
A polyhedral approach to the generalized minimum labeling spanning tree problem: Label: en
Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem: Label: en
Ten years of feasibility pump, and counting: Label: en
Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent: Label: en
Joint location and pricing within a user-optimized environment: Label: en
\(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario: Label: en
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games: Label: en
Special issue on bilevel optimization: Label: en
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks: Label: en
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers: Label: en
Core group placement: allocation and provisioning of heterogeneous resources: Label: en
A branch-and-cut algorithm for the target visitation problem: Label: en
Alternative SDP and SOCP approximations for polynomial optimization: Label: en
Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints: Label: en
A primal heuristic for optimizing the topology of gas networks based on dual information: Label: en
Observation thinning in data assimilation computations: Label: en
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations: Label: en
The complete vertex \(p\)-center problem: Label: en
Computing Euclidean Steiner trees over segments: Label: en
An exact approach for the multi-constraint graph partitioning problem: Label: en