The following pages link to Béla Vizvári (Q271918):
Displaying 50 items.
- Modeling supermarket re-layout from the owner's perspective (Q271919) (← links)
- A stochastic programming based analysis of the field use in a farm (Q475229) (← links)
- Maximum weight archipelago subgraph problem (Q490157) (← links)
- An application of Gomory cuts in number theory (Q580401) (← links)
- A stochastic programming and simulation based analysis of the structure of production on the arable land (Q666506) (← links)
- Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
- To lay out or not to lay out? (Q763111) (← links)
- (Q863609) (redirect page) (← links)
- Pattern-based feature selection in genomics and proteomics (Q863610) (← links)
- (Q1321638) (redirect page) (← links)
- An application of an optimal behaviour of the greedy solution in number theory (Q1321639) (← links)
- An ordering (enumerative) algorithm for nonlinear \(0-1\) programming (Q1338536) (← links)
- A heuristic for Boolean optimization problems (Q1402519) (← links)
- Simultaneous scheduling of production and preventive maintenance on a single machine (Q1640459) (← links)
- A note on the polytope of bipartite TSP (Q1682883) (← links)
- Weighted distances on the trihexagonal grid (Q1690380) (← links)
- An integer programming approach to characterize digital disks on the triangular grid (Q1690381) (← links)
- Modelling chaotic behaviour in agricultural prices using a discrete deterministic nonlinear price model (Q1808174) (← links)
- Empirical analysis of producer's price expectations. (Q1975989) (← links)
- On disks of the triangular grid: an application of optimization theory in discrete geometry (Q2185738) (← links)
- Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach (Q2331593) (← links)
- Weighted distances and digital disks on the Khalimsky grid. Disks with holes and islands (Q2403740) (← links)
- Effective solution of linear Diophantine equation systems with an application in chemistry (Q2503714) (← links)
- Target setting in data envelopment analysis: efficiency improvement models with predefined inputs/outputs (Q2656569) (← links)
- (Q2770788) (← links)
- New upper bounds on the probability of events based on graph structures (Q3422483) (← links)
- (Q3428842) (← links)
- (Q3436135) (← links)
- (Q3436146) (← links)
- (Q3515783) (← links)
- (Q3688459) (← links)
- (Q3765556) (← links)
- (Q3768676) (← links)
- On the greedy solution in integer linear programming (Q3768677) (← links)
- (Q3822244) (← links)
- (Q3823408) (← links)
- (Q3840335) (← links)
- On Pleasant Knapsack Problems (Q4035649) (← links)
- (Q4154367) (← links)
- (Q4181606) (← links)
- (Q4190437) (← links)
- (Q4190438) (← links)
- On the optimality of the greedy solutions of the general knapsack problems (Q4327882) (← links)
- (Q4432087) (← links)
- (Q4438917) (← links)
- (Q4672931) (← links)
- The integer programming background of a stochastic integer programming algorithm of dentcheva‐prékopa‐ruszczyński (Q4709738) (← links)
- Two algorithms to get strong Gomory cuts (Q4731009) (← links)
- (Q4801630) (← links)
- (Q4880190) (← links)
