The following pages link to (Q4040221):
Displaying 50 items.
- Mathematical model for cyclic scheduling with work-in-process minimization (Q656064) (← links)
- Boolean-controlled systems via receding horizon and linear programing (Q661011) (← links)
- Production-process optimization algorithm: application to fed-batch bioprocess (Q682728) (← links)
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure. (Q684381) (← links)
- A polynomial-time algorithm for computing the yolk in fixed dimension (Q687092) (← links)
- On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint (Q687374) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Testing balancedness and perfection of linear matrices (Q689142) (← links)
- Forecast horizons and dynamic facility location planning (Q689237) (← links)
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times (Q695342) (← links)
- Ideal clutters (Q697573) (← links)
- New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems (Q700701) (← links)
- New bundle methods for solving Lagrangian relaxation dual problems (Q700752) (← links)
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) (← links)
- Inverse integer programming (Q732771) (← links)
- Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem (Q742303) (← links)
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- The sparse signomial classification and regression model (Q744718) (← links)
- A combinatorial optimization approach to the selection of statistical units (Q747022) (← links)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- Quantitatively fair scheduling (Q764298) (← links)
- A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences (Q780181) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming (Q814696) (← links)
- Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)
- Locating active sensors on traffic networks (Q816421) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- Integer-programming software systems (Q817202) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← links)
- Order cones: a tool for deriving \(k\)-dimensional faces of cones of subfamilies of monotone games (Q827276) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
- A two-stage stochastic programming approach for project planning with uncertain activity durations (Q835555) (← links)
- Genetic algorithms applied to the solution of hybrid optimal control problems in astrodynamics (Q835788) (← links)
- Computing generating sets of lattice ideals and Markov bases of lattices (Q840713) (← links)
- Efficient reformulation and solution of a nonlinear PDE-controlled flow network model (Q841133) (← links)
- A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
