The following pages link to (Q4265265):
Displaying 49 items.
- Projection, consistency, and George Boole (Q265702) (← links)
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Timetable construction: the algorithms and complexity perspective (Q475200) (← links)
- Finding checkerboard patterns via fractional 0-1 programming (Q604870) (← links)
- Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
- The combinatorial bandwidth packing problem (Q621657) (← links)
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision (Q721144) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- Using aggregation to optimize long-term production planning at an underground mine (Q852993) (← links)
- Composite-variable modeling for service parts logistics (Q867536) (← links)
- Scheduling web advertisements: a note on the minspace problem (Q880489) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- Integral analysis method - IAM (Q1011236) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Benders decomposition for curriculum-based course timetabling (Q1652557) (← links)
- An integer linear programming formulation for the minimum cardinality segmentation problem (Q1736729) (← links)
- Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880) (← links)
- A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
- Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling (Q1991148) (← links)
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization (Q2077960) (← links)
- A study on the optimal inventory allocation for clinical trial supply chains (Q2247342) (← links)
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach (Q2281738) (← links)
- Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910) (← links)
- Calculating the best dual bound for problems with multiple Lagrangian relaxations (Q2391512) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- A method for solving the general parametric linear complementarity problem (Q2430616) (← links)
- Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
- Optimization models for the single delay management problem in public transportation (Q2482752) (← links)
- The selection and scheduling of telecommunication calls with time windows (Q2484356) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- Equitable routing of rail hazardous materials shipments using CVaR methodology (Q2668637) (← links)
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540) (← links)
- A tutorial on the balanced minimum evolution problem (Q2670555) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- A nested benders decomposition approach for telecommunication network planning (Q3588806) (← links)
- A novel modeling approach for express package carrier planning (Q3627939) (← links)
- On general decomposition schemes in mathematical programming (Q3716854) (← links)
- Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications (Q5108241) (← links)
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion (Q5191135) (← links)
- (Q5860516) (← links)
- Rational elimination algorithm and applications (Q5862846) (← links)
- A strong integer linear optimization model to the compartmentalized knapsack problem (Q6088168) (← links)
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)
