The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- A branch-and-price algorithm for the bin packing problem with conflicts (Q2899132) (← links)
- Lifted tableaux inequalities for \(0\)-\(1\) mixed-integer programs: a computational study (Q2899134) (← links)
- Minimal equivalent binary knapsack inequalities (Q2899135) (← links)
- Efficient optimization of reliable two-node connected networks: a biobjective approach (Q2899136) (← links)
- Color-coding algorithms to the balanced path problem: computational issues (Q2899137) (← links)
- Preprocessing stochastic shortest-path problems with application to PERT activity networks (Q2899138) (← links)
- The reliable facility location problem: formulations, heuristics, and approximation algorithms (Q2899140) (← links)
- An efficient global approach for posynomial geometric programming problems (Q2899141) (← links)
- Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets (Q2899142) (← links)
- Optimal testing of digital microfluidic biochips (Q2899144) (← links)
- New stabilization procedures for the cutting stock problem (Q2899145) (← links)
- Solving large \(p\)-median problems with a radius formulation (Q2899146) (← links)
- Optimization of supply chain systems with price elasticity of demand (Q2899147) (← links)
- An improved primal simplex algorithm for degenerate linear programs (Q2899148) (← links)
- Experiments with two-row cuts from degenerate tableaux (Q2899149) (← links)
- A method for approximating univariate convex functions using only function value evaluations (Q2899150) (← links)
- Combination of nonlinear and linear optimization of transient gas networks (Q2899151) (← links)
- A new evolutionary algorithm for a class of nonlinear bilevel programming problems and its global convergence (Q2899152) (← links)
- A clock-and-offer auction market for grid resources when bidders face stochastic computational needs (Q2899153) (← links)
- Monitoring an information source under a politeness constraint (Q2900988) (← links)
- The integrated production and transportation scheduling problem for a product with a short lifespan (Q2900989) (← links)
- Discovering generalized profile-association rules for the targeted advertising of new products (Q2900990) (← links)
- Decision-tree-based knowledge discovery: single- vs. multi-decision-tree induction (Q2900992) (← links)
- Scatter search for the point-matching problem in 3D image registration (Q2900994) (← links)
- A constraint logic programming algorithm for modeling dynamic pricing (Q2900995) (← links)
- A model for fresh produce shelf-space allocation and inventory management with freshness-condition-dependent demand (Q2900996) (← links)
- Novel local-search-based approaches to university examination timetabling (Q2900997) (← links)
- A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem (Q2900998) (← links)
- Time-indexed formulations and the total weighted tardiness problem (Q2900999) (← links)
- Edge finding for cumulative scheduling (Q2901000) (← links)
- A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities (Q2901001) (← links)
- A noniterative algorithm for the linear-quadratic profit-maximization model for smoothing multiproduct production (Q2901002) (← links)
- An algorithm for computing minimal Coxian representations (Q2901003) (← links)
- Speeding up dynamic shortest-path algorithms (Q2901004) (← links)
- Matchings in node-weighted convex bipartite graphs (Q2901005) (← links)
- Algorithms for the constrained two-staged two-dimensional cutting problem (Q2901006) (← links)
- The \(K\) king problem, an abstract model for computing aircraft landing trajectories: on modeling a dynamic hybrid system with constraints (Q2901007) (← links)
- A tensor sum preconditioner for stochastic automata networks (Q2901008) (← links)
- Solving the capacitated local access network design problem (Q2901009) (← links)
- A faster index algorithm and a computational study for bandits with switching costs (Q2901010) (← links)
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics (Q2901011) (← links)
- Exploiting the structural properties of the underlying Markov decision problem in the Q-learning algorithm (Q2901012) (← links)
- A metaheuristic approach for the vertex coloring problem (Q2901013) (← links)
- Risk minimization and minimum description for linear discriminant functions (Q2901014) (← links)
- Heuristic and exact algorithms for the identical parallel machine scheduling problem (Q2901015) (← links)
- Predicting bidders' willingness to pay in online multiunit ascending auctions: analytical and empirical insights (Q2901017) (← links)
- Improving intrusion prevention models: dual-threshold and dual-filter approaches (Q2901019) (← links)
- Extreme point-based heuristics for three-dimensional bin packing (Q2901020) (← links)
- Efficient jump ahead for \(\mathbb{F}_{2}\)-linear random number generators (Q2901021) (← links)
- Optimal broadcast scheduling in packet radio networks via branch and price (Q2901022) (← links)
