The following pages link to (Q4254875):
Displaying 50 items.
- Searching multiregression dynamic models of resting-state fMRI networks using integer programming (Q273610) (← links)
- Polynomial invariants for arbitrary rank \(D\) weakly-colored stranded graphs (Q274859) (← links)
- MMC techniques for limited dependent variables models: implementation by the branch-and-bound algorithm (Q275248) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Dynamic resource allocation problem for transportation network evacuation (Q291681) (← links)
- Optimization-based heuristics for underground mine scheduling (Q299816) (← links)
- Bus driver duty optimization using an integer programming and evolutionary hybrid algorithm (Q301129) (← links)
- Local convex hulls for a special class of integer multicommodity flow problems (Q301702) (← links)
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets (Q312703) (← links)
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- A parallelised distributed implementation of a branch and fix coordination algorithm (Q319288) (← links)
- Valid inequalities for the synchronization bus timetabling problem (Q322699) (← links)
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- On solving manufacturing cell formation via bicluster editing (Q323416) (← links)
- Robust optimisation of green wireless LANs under rate uncertainty and user mobility (Q325447) (← links)
- Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem (Q331982) (← links)
- A fix-and-optimize heuristic for the high school timetabling problem (Q337176) (← links)
- Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation (Q337206) (← links)
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
- The dynamic vehicle allocation problem with application in trucking companies in Brazil (Q342558) (← links)
- Using and extending fix-and-relax to solve maritime inventory routing problems (Q356520) (← links)
- A multi-shift vehicle routing problem with windows and cycle times (Q360503) (← links)
- Unit commitment in oligopolistic markets by nonlinear mixed variable programming (Q374676) (← links)
- A two-stage stochastic mixed-integer programming approach to the index tracking problem (Q374678) (← links)
- A primal-dual backtracking optimization method for blended composite structures (Q381765) (← links)
- Scheduling satellite launch missions: an MILP approach (Q398832) (← links)
- A Lagrange relaxation method for solving weapon-target assignment problem (Q410577) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems (Q436728) (← links)
- Connectivity-and-hop-constrained design of electricity distribution networks (Q439454) (← links)
- A parametric branch and bound approach to suboptimal explicit hybrid MPC (Q463830) (← links)
- Model-based decision support for optimal brochure pricing: applying advanced analytics in the tour operating industry (Q480749) (← links)
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks (Q490218) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Supersparse linear integer models for optimized medical scoring systems (Q506427) (← links)
- A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
- Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
- Mathematical models of the bandpass problem and OrderMatic computer game (Q552155) (← links)
- Multi-level single machine lot-sizing and scheduling with zero lead times (Q621969) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Forestry management under uncertainty (Q666469) (← links)
- Modeling forest core area with integer programming (Q666471) (← links)
- A tactical model for planning the production and distribution of fresh produce (Q666508) (← links)
- On the incorporation of adversarial reasoning in course of action analysis and resource allocation (Q691371) (← links)
- Modeling with discrete-time recurrent fuzzy systems via mixed-integer optimization (Q695247) (← links)
- An efficient Lagrangean heuristic for rental vehicle scheduling (Q709131) (← links)
- Optimal wafer cutting in shuttle layout problems (Q719028) (← links)
- Tight MIP formulations of the power-based unit commitment problem (Q747751) (← links)
- Integer-programming software systems (Q817202) (← links)
